2017-06-24, 12:11 | #1 |
May 2004
2^{2}×79 Posts |
Modified Fermat pseudoprime
We can define above as a composite number which behaves like
a prime number with respect to modified Fermat's theorem. Example: 21; (7 + i)^440==1 (mod 21). Note (7+i)^20 is not congruent to 1 (mod 21). |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Conjecture pertaining to modified Fermat's theorem | devarajkandadai | Number Theory Discussion Group | 12 | 2017-12-25 05:43 |
Modified Fermat's theorem | devarajkandadai | Number Theory Discussion Group | 14 | 2017-11-12 20:04 |
modified Euler's generalisation of Fermat's theorem | devarajkandadai | Number Theory Discussion Group | 1 | 2017-07-07 13:56 |
Modified Fermat's theorem | devarajkandadai | Number Theory Discussion Group | 2 | 2017-06-23 04:39 |
Modified fermat's last theorem | Citrix | Math | 24 | 2007-05-17 21:08 |