Entries from 2007-03-04 to 1 day
A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) for every choice of a satisfying (a,n)==1 (i.e., a and n are relatively prime) with 1 r = (2..101) primes = r.inject(r){|p, i| p.s…