Hi, everybody!!!
I have the follow quest...
I have two numbers N and K, i need to check that N^N = K.
for example:
if N=2 and K=4 , 2^2 = 4 so return true;
if N=3 and K=26 , 3^3 != 26 so return false
But 0<=N , K<=1000 so N^N could be have 1000 digits.
I program in C++, and i can use Bignum (array manipulation) + fast
power(binary power) but i want to know if exist a mathematical property.
--
Victor Manuel Grijalva Altamirano
Universidad Tecnologica de La Mixteca
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
