giant number is not a prime - Page 2

paulunderwood · 2020-09-15, 15:50

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)

drmurat · 2020-09-15, 16:06

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
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED!	dabaichi	News	571	2020-10-26 11:02
My Prime Number	Bixodomt	Miscellaneous Math	19	2019-08-06 00:23
Number of distinct prime factors of a Double Mersenne number	aketilander	Operazione Doppi Mersennes	1	2012-11-09 21:16
Estimating the number of prime factors a number has	henryzz	Math	7	2012-05-23 01:13
When do I know if the number is prime?	uniqueidlondon	Software	1	2003-05-17 16:57