20200915, 15:50  #12 
Sep 2002
Database er0rr
5·701 Posts 
Code:
Mod(10,107)^100000000000000000000000000000000000000000 Mod(34, 107) ## *** last result computed in 0 ms It actually works by leftright 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) Code:
Mod(10,107)^(100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000%106) Mod(4, 107) Last fiddled with by paulunderwood on 20200915 at 16:06 
20200915, 16:06  #13  
"murat"
May 2020
turkey
111110_{2} Posts 
Quote:
Thanks 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED!  dabaichi  News  571  20201026 11:02 
My Prime Number  Bixodomt  Miscellaneous Math  19  20190806 00:23 
Number of distinct prime factors of a Double Mersenne number  aketilander  Operazione Doppi Mersennes  1  20121109 21:16 
Estimating the number of prime factors a number has  henryzz  Math  7  20120523 01:13 
When do I know if the number is prime?  uniqueidlondon  Software  1  20030517 16:57 