mersenneforum.org giant number is not a prime
 Register FAQ Search Today's Posts Mark Forums Read

 2020-09-15, 15:50 #12 paulunderwood     Sep 2002 Database er0rr 343810 Posts Code: Mod(10,107)^100000000000000000000000000000000000000000 Mod(34, 107) ## *** last result computed in 0 ms . It actually works by left-right binary exponentiation modulo n And since 107 is prime we can use Fermat's little theorem: Code: Mod(10,107)^(100000000000000000000000000000000000000000%106) Mod(34, 107) Or something even "bigger": Code: Mod(10,107)^(100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000%106) Mod(4, 107) Last fiddled with by paulunderwood on 2020-09-15 at 16:06
2020-09-15, 16:06   #13
drmurat

"murat"
May 2020
turkey

53 Posts

Quote:
 Originally Posted by paulunderwood Code: Mod(10,107)^100000000000000000000000000000000000000000 Mod(34, 107) ## *** last result computed in 0 ms . It actually works by left-right binary exponentiation modulo n And since 107 is prime we can use Fermat's little theorem: Code: Mod(10,107)^(100000000000000000000000000000000000000000%106) Mod(34, 107) Or simething even "bigger": Code: Mod(10,107)^(100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000%106) Mod(4, 107)

Thanks

 Similar Threads Thread Thread Starter Forum Replies Last Post Bixodomt Miscellaneous Math 19 2019-08-06 00:23 dabaichi News 561 2013-03-29 16:55 aketilander Operazione Doppi Mersennes 1 2012-11-09 21:16 henryzz Math 7 2012-05-23 01:13 uniqueidlondon Software 1 2003-05-17 16:57

All times are UTC. The time now is 00:59.

Thu Oct 22 00:59:00 UTC 2020 up 41 days, 22:09, 0 users, load averages: 1.99, 1.52, 1.52