Write the shortest (measured by steps not keystokes) program for 3 root...Platform: HP 12C
Programming challenge (HP 12C)
|
03-28-2002, 03:08 AM
03-28-2002, 04:15 AM
Is it allowed to use y^x? :-) Or the LN / e^x functions? :-) Or should algorithms avoiding these functions be used? :-(
03-28-2002, 05:20 AM
My solution is 4 steps long, but it seems that you've already guessed it ... :-)
BTW y^x makes it 5 steps long.
03-28-2002, 05:52 AM
> I have to work on more difficult challenge next time... Not really! Just don't allow the usage of these functions of the 12C. That's a little harder nut to crack (for someone whose math courses are long-forgotten, like me ;-) Someone remembers how to do?
03-28-2002, 08:39 AM
Hello; I did not get to the point (Sorry!). What is 3 root?
03-28-2002, 12:01 PM
I guess this is you solution : y = e^((ln x)/3) so the steps are :
01 43 23 g e^x
03-28-2002, 08:44 PM
Why is this even a challenge? [3] [1/x] [y^x] |
« Next Oldest | Next Newest »
|