3 ms·
Is there a more generalized version of that pattern, perhaps something like this (I haven't checked): let P(n) be the nth prime number: P(1)=2, etc. let n
by nitrogen 16y ago
Is there a more generalized version of that pattern, perhaps something like this (I haven't checked):
let P(n) be the nth prime number: P(1)=2, etc.
let n be an integer >= 2, and m be an integer > n
then P(m) ≡ 1 and (P(n) - 1) (mod P(n))
?