Difference between revisions of "Carmichael number"

(Created page with "==Carmichael numbers== Carmichael numbers are composite numbers that satisfy Fermat's Little Theorem even though they are not primes. The smallest Carmichael numb...")
 
m
Line 6: Line 6:
  
 
  - [[Fermat's Little Theorem]]
 
  - [[Fermat's Little Theorem]]
 +
 +
~ [[User:Enderramsby]]

Revision as of 10:49, 1 August 2022

Carmichael numbers

Carmichael numbers are composite numbers that satisfy Fermat's Little Theorem even though they are not primes. The smallest Carmichael number is $561.$

See Also

- Fermat's Little Theorem

~ User:Enderramsby