Summary: 1. Fermat's Little Theorem: if p is prime, then b^p = b (mod p) for all integers b. i.e. b^p - b is always a multiple of p. 8^3-8 = 512-8 = 504 = 168 x 3. 2. Is the inverse true? Does b^n - b = 0 (mod n) mean that n is prime? No. Sometimes n is non-prime (like n=561, divisible by 3). We call these n, Carmichael numbers. 3. Okay, so these numbers exist. How common are they? For primes we know they're common.…
>> In fact, Larsen’s argument didn’t just allow him to show that a Carmichael number must always appear between X and 2X.
And yet the Wikipedia page says 2821 and 6601 are the 5th and 6th Carmichael numbers, which means there are not between 3000 and 6000 (X and 2X). So is his result actually that one must always exist between X and 2.5X or some other small multiple? If so, what multiple did he prove?