|
| |
|
|
A020162
|
|
Pseudoprimes to base 34.
|
|
1
|
|
|
|
15, 21, 33, 35, 55, 65, 77, 105, 165, 231, 273, 385, 429, 435, 445, 671, 703, 1001, 1045, 1065, 1155, 1157, 1281, 1365, 1729, 1869, 1891, 2035, 2059, 2071, 2145, 2779, 2821, 2937, 3201, 3605, 4033, 4795, 5005, 5161, 5565, 5785, 5995, 6305, 6533, 6601, 6853
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Composite numbers n such that 34^(n-1) == 1 (mod n). - Michel Lagneau, Feb 18 2012
|
|
|
LINKS
|
|
|
|
MATHEMATICA
|
base = 34; b34Pseudos = {}; n = 1; While[Length[b34Pseudos] < 100, n++; If[!PrimeQ[n] && PowerMod[base, n - 1, n] == 1, AppendTo[b34Pseudos, n]]]; b34Pseudos (* T. D. Noe, Feb 21 2012 *)
searchMax = 7000; Complement[Select[Range[searchMax], PowerMod[34, # - 1, #] == 1 &], Prime[Range[PrimePi[searchMax]]]] (* Alonso del Arte, Feb 17 2020 *)
|
|
|
CROSSREFS
|
Cf. A001567 (pseudoprimes to base 2).
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
