11/13/2015, 05:58 PM

I'm not sure if this should be in a different thread, but I just found a website with programming puzzles, and one of the puzzles is super-roots:

http://www.checkio.org/mission/super-root/

this "mission" (programming puzzle) has a very large number of "solutions" (Python implementations) of super-roots. After you login and solve the mission, it will show you other people's solutions along with your own. I solved it using the infinite tetrate (x^x^x^...) which is probably not the fastest method, but I think it's more beautiful than using Newton's method with an unknown number of iterations until you find the right number.

Most of the solutions are based on Newton's method or a similar bisection method, but I was considering going thru them to see if there's any new methods we didn't know about...

http://www.checkio.org/mission/super-root/

this "mission" (programming puzzle) has a very large number of "solutions" (Python implementations) of super-roots. After you login and solve the mission, it will show you other people's solutions along with your own. I solved it using the infinite tetrate (x^x^x^...) which is probably not the fastest method, but I think it's more beautiful than using Newton's method with an unknown number of iterations until you find the right number.

Most of the solutions are based on Newton's method or a similar bisection method, but I was considering going thru them to see if there's any new methods we didn't know about...