Radical Simplifier
 |
Name: Radical Simplifier Author: Timothy Foster Download: Radical.zip Compatibility: TI-83+/84/SE File Size: 274 Bytes |
This program will simplify nearly any radical expression in the form of the nth root of x by removing the perfect n factors from under the radical. This program features very fast load times, index reduction, and imaginary simplifications. |
Want to update this page?
- Upload new files to provide up-to-date versions of your program;
- or Edit the content of this page to provide up-to-date information about your program.
A moderator will only process these changes if you add the word update to the list of tags
What the community thinks:
This is just another one of those radical simplifiers. The best accomplishment of this particular program is the index reduction ability, something most radical programs probably don't do. It is also fast and compact (less than 300 bytes). If you have any suggestions, or you found a place where it fails, then please comment.
Timothy Foster - @tfAuroratide
Auroratide.com - Go here if you're nerdy like me
I like your code! I did a few test runs, and it seems to work fine! I was looking at your code, and I have a few suggestions to save characters:
One of your conditionals is this: If not(fPart(round(Ansx√B, and has a redundant round; you could rewrite like this: If not(fPart(Ansx√B.
Three lines after, the line reads {Lx√B→B:C. The last :C seems redundant.
After the first output dialogue, Ans becomes 1+(-image(J)+real(J)≠1)+int(log(A; this can be rewritten as 1+(real(J)-image(J)≠1)+int(log(A.
Very swift, efficient, and displays a mastery of knowledge of BASIC. Kudos! I wish I had this for my Algebra I class :D