[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Search: a231613 -id:a231613
     Sort: relevance | references | number | modified | created      Format: long | short | data
Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.
+10
6
2, 6, 90, 960, 1974, 2430, 2730, 2736, 6006, 6096, 6306, 7014, 11934, 14190, 18276, 18486, 21204, 24906, 24984, 25200, 27210, 35700, 38556, 39306, 40860, 44694, 45654, 47124, 49524, 51246, 53220, 56700, 58176, 63330, 63960, 72996, 76650, 80394, 85560
OFFSET
1,1
COMMENTS
Schinzel's hypothesis H, if true, would imply that there are an infinite number of k that yield simultaneous primes. Note that the two first-degree cyclotomic polynomials, x-1 and x+1, yield the twin primes for the numbers in A014574.
From Ryan Bresler and Russell Jarrett, May 03 2019: (Start)
All these k, except k=2, are multiples of 6.
Proof:
Suppose k == 1 (mod 3); then we have
k^2 == 1 (mod 3),
k^2 + 1 == 2 (mod 3), and
k^2 + 1 + k == 0 (mod 3),
so k^2 + 1 + k cannot be prime if k == 1 (mod 3).
Now suppose k == 2 (mod 3); then
k^2 == 1 (mod 3),
k^2 + 1 == 2 (mod 3), and
k^2 + 1 - k == 0 (mod 3),
so k^2 + 1 - k cannot be prime if k == 2 (mod 3) (with the exception of k=2, which yields k^2 + 1 - k = 2^2 + 1 - 2 = 4+1-2 = 3, which is prime).
Now suppose k == 0 (mod 3); then
k^2 == 0 (mod 3) and
k^2 + 1 == 1 (mod 3),
so k^2 + 1 + k == 1 (mod 3) and k^2 + 1 - k == 1 (mod 3).
Therefore k^2 + 1, k^2 + 1 + k and k^2 + 1 - k can all be prime only if k=2 or k == 0 (mod 3).
Finally, if k == 1 (mod 2) for k > 2, then we have
k^2 == 1 (mod 2), and
k^2 + 1 == 0 (mod 2),
so k^2 + 1 cannot be prime if k == 1 (mod 2).
Now suppose k == 0 (mod 2); then
k^2 + 1 == 1 (mod 2),
so k^2 + 1 + k == 1 (mod 2) and k^2 + 1 - k == 1 (mod 2).
Therefore, for k > 2, k == 0 (mod 2) and k == 0 (mod 3) must be satisfied for k^2 + 1, k^2 + 1 + k and k^2 + 1 - k to all be prime.
(End)
REFERENCES
Paulo Ribenboim, The New Book of Prime Number Records, Springer, 1996, p. 391.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer, Second Edition, 2000, pp. 256-259.
EXAMPLE
6 is a term of this sequence because 31, 37 and 43 are primes.
MATHEMATICA
x=0; Table[x=x+2; While[ !(PrimeQ[1+x^2] && PrimeQ[1+x+x^2] && PrimeQ[1-x+x^2]), x=x+2]; x, {50}]
Join[{2}, Select[Range[6, 80000, 6], And@@PrimeQ[{#^2+1, #^2-#+1, #^2+#+1}]&]] (* Harvey P. Dale, Apr 07 2013 *)
PROG
(Magma) [m:m in [1..90000]| IsPrime(m^2+1) and IsPrime(m^2-m+1) and IsPrime(m^2+m+1) ]; // Marius A. Burtea, May 07 2019
CROSSREFS
Cf. A014574 (first degree solutions: average of twin primes).
Cf. A231612 (similar, but with fourth-degree cyclotomic polynomials).
Cf. A231613 (similar, but with sixth-degree cyclotomic polynomials).
Cf. A231614 (similar, but with eighth-degree cyclotomic polynomials).
Cf. A233512 (similar, but increasing number of cyclotomic polynomials).
KEYWORD
nonn
AUTHOR
T. D. Noe, Aug 27 2003
EXTENSIONS
Definition and comment revised by N. J. A. Sloane, Sep 23 2019
STATUS
approved
Numbers n such that the four fourth-degree cyclotomic polynomials are simultaneously prime.
+10
4
2, 90750, 194468, 229592, 388332, 868592, 1054868, 1148390, 1380380, 1415920, 1461372, 1496010, 1614800, 1706398, 1992210, 2439042, 2478212, 2644498, 2791910, 3073300, 3264448, 3824370, 3892780, 3939222, 3941938, 4425970, 4468980, 4594138, 4683700
OFFSET
1,1
COMMENTS
The polynomials are cyclotomic(5,x) = 1 + x + x^2 + x^3 + x^4, cyclotomic(8,x) = 1 + x^4, cyclotomic(10,x) = 1 - x + x^2 - x^3 + x^4, and cyclotomic(12,x) = 1 - x^2 + x^4. The numbers 5, 8, 10, and 12 are in the fourth row of A032447.
By Schinzel's hypothesis H, there are an infinite number of n that yield simultaneous primes. Note that the two first-degree cyclotomic polynomials, x-1 and x+1, yield the twin primes for the numbers in A014574.
REFERENCES
See A087277.
MATHEMATICA
Select[Range[5000000], PrimeQ[Cyclotomic[5, #]] && PrimeQ[Cyclotomic[8, #]] && PrimeQ[Cyclotomic[10, #]] && PrimeQ[Cyclotomic[12, #]] &]
Select[Range[47*10^5], AllTrue[Thread[Cyclotomic[{5, 8, 10, 12}, #]], PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Feb 22 2018 *)
CROSSREFS
Cf. A014574 (first degree solutions: average of twin primes).
Cf. A087277 (similar, but with second-degree cyclotomic polynomials).
Cf. A231613 (similar, but with sixth-degree cyclotomic polynomials).
Cf. A231614 (similar, but with eighth-degree cyclotomic polynomials).
KEYWORD
nonn
AUTHOR
T. D. Noe, Dec 11 2013
STATUS
approved
Numbers n such that the five eighth-degree cyclotomic polynomials are simultaneously prime.
+10
4
4069124, 8919014, 8942756, 46503870, 75151624, 82805744, 189326670, 197155324, 271490544, 365746304, 648120564, 1031944990
OFFSET
1,1
COMMENTS
The polynomials are cyclotomic(15,x) = 1 + x + x^2 + x^3 + x^4 + x^5 + x^6 + x^7 + x^8, cyclotomic(16,x) = 1 + x^8, cyclotomic(20,x) = 1 - x^2 + x^4 - x^6 + x^8, cyclotomic(24,x) = 1 - x^4 + x^8, and cyclotomic(30,x) = 1 + x - x^3 - x^4 - x^5 + x^7 + x^8. The numbers 15, 16, 20, 24 and 30 are in the eighth row of A032447.
By Schinzel's hypothesis H, there are an infinite number of n that yield simultaneous primes. Note that the two first-degree cyclotomic polynomials, x-1 and x+1, yield the twin primes for the numbers in A014574.
REFERENCES
See A087277.
MATHEMATICA
t = {}; n = 0; While[Length[t] < 6, n++; If[PrimeQ[Cyclotomic[15, n]] && PrimeQ[Cyclotomic[16, n]] && PrimeQ[Cyclotomic[20, n]] && PrimeQ[Cyclotomic[24, n]] && PrimeQ[Cyclotomic[30, n]], AppendTo[t, n]]]; t
CROSSREFS
Cf. A014574 (first degree solutions: average of twin primes).
Cf. A087277 (similar, but with second-degree cyclotomic polynomials).
Cf. A231612 (similar, but with fourth-degree cyclotomic polynomials).
Cf. A231613 (similar, but with sixth-degree cyclotomic polynomials).
KEYWORD
nonn,more
AUTHOR
T. D. Noe, Dec 11 2013
EXTENSIONS
Extended to 12 terms by T. D. Noe, Dec 13 2013
STATUS
approved
The first n cyclotomic polynomials are simultaneously prime for these arguments.
+10
1
3, 4, 6, 150, 1068630, 6770610
OFFSET
1,1
COMMENTS
The first six cyclotomic polynomials are x - 1, x + 1, x^2 + x + 1, x^2 + 1, x^4 + x^3 + x^2 + x + 1, and x^2 - x + 1.
By Schinzel's hypothesis H, this sequence is defined for all n.
a(7) > 2*10^9.
REFERENCES
See A087277.
EXAMPLE
At x = 3, x-1 = 2, which is prime. At x = 4, x-1 = 3 and x+1 = 5, which are both prime. At x = 6, x-1 = 5, x+1 = 7, and x^2+x+1 = 43, which are all prime.
MATHEMATICA
t = {}; n = 0; len = 0; While[len < 6, n++; found = True; i = 1; While[found && i <= len + 1, found = PrimeQ[Cyclotomic[i, n]]; i++]; If[found && i > len + 1, AppendTo[t, n]; len++]]; t
CROSSREFS
Cf. A014574 (first degree solutions: average of twin primes).
Cf. A087277 (similar, but with second-degree cyclotomic polynomials).
Cf. A231612 (similar, but with fourth-degree cyclotomic polynomials).
Cf. A231613 (similar, but with sixth-degree cyclotomic polynomials).
Cf. A231614 (similar, but with eighth-degree cyclotomic polynomials).
KEYWORD
nonn,hard,more
AUTHOR
T. D. Noe, Dec 13 2013
STATUS
approved

Search completed in 0.006 seconds