Main Page | Report this Page
 
Loading..
   
Science Forum Index  »  Cryptography Forum  »  power detection?
Page 1 of 1    
Author Message
Tom St Denis
Posted: Sat Jan 03, 2004 6:23 pm
Guest
I tried some citeseering but couldn't find anything..

Any references on detecting whether an integer is a prime power? Obviously
there is the brute force solution (e.g. try roots from 2 to log_2(n)) but
that could get slow...

Thanks,
Tom
Back to top
 
Page 1 of 1       All times are GMT - 5 Hours
The time now is Sat Jul 26, 2008 5:15 pm
Science Forum Index

Powered by phpBB & ML | Disclaimer



Contact Us