3
This number is a prime.
Just showing those entries submitted by 'Dunn': (Click here to show all)
![]() |
| Jason Funk © 2002 |
(2^(p-1)-1)/p is congruent to 0 (mod 3), for all primes p greater than 3. This is a corollary to Fermat's Little Theorem. [Dunn]
Printed from the PrimePages <t5k.org> © G. L. Honaker and Reginald McLean
