> as lemmas
absolute pseudoprime
pseudoprime n. and adj.
Brit. 
/ˈs(j)uːdə(ʊ)prʌɪm/
, /ˈs(j)uːdə(ʊ)prʌɪm/U.S. /ˈsudoʊˌpraɪm/
Mathematics (a) n. any integer p for which ap − a is a multiple of p for a given positive integer a (the base), or (in full absolute pseudoprime) for all positive integers, or for all positive integers where a and p are relatively prime; (b) adj. designating such a number./ˈsudoʊˌpraɪm/ΘΚΠ
the world > relative properties > number > mathematical number or quantity > [adjective] > prime > pseudoprime
pseudoprime1949
the world > relative properties > number > mathematical number or quantity > [noun] > particular qualities > prime > relating to
Mersenne1892
Fermat('s) number1906
twin prime1930
pseudoprime1949
Skewes1949
1949 Amer. Math. Monthly 56 623 Following Lehmer we shall call an integer n a pseudoprime if 2n≡ 2 (mod n) and n is not a prime.
1978 Amer. Math. Monthly 85 293 561 (= 3 x 11 x 17) is an ‘absolute pseudoprime’, i.e. it divides a561 − a for every a.
1988 H. E. Rose Course in Number Theory i. 12 Extremely efficient methods exist for checking whether or not an integer is pseudoprime with respect to some fixed integer n.
1997 Sci. Amer. May 84/3 Unfortunately, every base has infinitely many pseudoprimes, so we can't just find a really good base and use only that.
<
as lemmas