|
Search: id:A082484
|
|
|
| A082484 |
|
First of four consecutive primes p, q, r, s such that neither of the congruences p^x+q^x = r (mod s) and q^x-p^x = r (mod s) has a solution. |
|
+0
2
|
|
| 3, 53, 71, 97, 109, 127, 137, 149, 151, 179, 197, 239, 293, 311, 401, 419, 431, 439, 457, 467, 503, 557, 563, 601, 619, 641, 643, 653, 673, 769, 887, 907, 971, 991, 1021, 1031, 1093, 1103, 1123, 1151, 1297, 1361, 1367, 1373, 1427, 1447, 1459, 1471, 1481
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Is this sequence infinite?
|
|
FORMULA
|
a(n) = prime(A082475(n)).
|
|
EXAMPLE
|
2 is not in the sequence because 2^1+3^1 = 5 (mod 7).
17 is not in the sequence because 19^4-17^4 = 23 (mod 29).
|
|
PROGRAM
|
(PARI) { for (p = 1, 300, f = 0; for (x = 1, prime(p + 3) - 1, if ((prime(p + 1)^x + prime(p)^x - prime(p + 2))%prime(p + 3) == 0 || (prime(p + 1)^x - prime(p)^x - prime(p + 2))%prime(p + 3) == 0, f = 1; break)); if (f == 0, print(prime(p)))) }
|
|
CROSSREFS
|
Cf. A082371, A082475.
Sequence in context: A030180 A005547 A136723 this_sequence A106997 A141929 A036941
Adjacent sequences: A082481 A082482 A082483 this_sequence A082485 A082486 A082487
|
|
KEYWORD
|
easy,nonn,less
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), May 11 2003
|
|
EXTENSIONS
|
Edited and extended by David Wasserman (dwasserm(AT)earthlink.net), Oct 12 2006
|
|
|
Search completed in 0.002 seconds
|
