|
Search: id:A059667
|
|
|
| A059667 |
|
Primes p such that x^49 = 2 has no solution mod p, but x^7 = 2 has a solution mod p. |
|
+0
12
|
|
| 4999, 6959, 7351, 11467, 15583, 16073, 20483, 21169, 21757, 30773, 35771, 37339, 38711, 41161, 45179, 46649, 48119, 51157, 51647, 57527, 58997, 64877, 75167, 75853, 80263, 83791, 84869, 85751, 86927, 93983, 95747, 105253, 110251, 115837
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
PROGRAM
|
(PARI) forprime(p=2, 116000, x=0; while(x<p&&x^7%p!=2%p, x++); if(x<p, y=0; while(y<p&&y^(7^2)%p!=2%p, y++); if(y==p, print1(p, ", "))))
|
|
CROSSREFS
|
Cf. A042966, A042967, A070179 - A070188.
Sequence in context: A070001 A145540 A031840 this_sequence A106767 A157367 A035787
Adjacent sequences: A059664 A059665 A059666 this_sequence A059668 A059669 A059670
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Feb 04 2001
|
|
|
Search completed in 0.002 seconds
|
