|
|
A174022
|
|
Primes p for which the Fekete polynomial fp(x) has a zero between 0 and 1.
|
|
1
|
|
|
43, 67, 163, 173, 293, 331, 379, 463, 487, 499, 547, 643, 677, 683, 773, 797, 823, 853, 883, 907, 941, 947, 967, 1013, 1051, 1087, 1097, 1123, 1163, 1217, 1229, 1303, 1423, 1493, 1523, 1553, 1567, 1613, 1637, 1693, 1723, 1747, 1787, 1867, 1877, 1987, 1997
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The Fekete polynomial fp(x) is defined as sum_{k=0..p-1} (k|p) x^k, where (k|p) is the Legendre symbol. Conrey et al. mention that there are 23 such primes less than 1000, which is verified here. The coefficients of the polynomial are in the rows of sequence A097343. It appears that zeros in (0,1) always come in pairs. As noted by Franz Lemmermeyer in Math Overflow, it appears that after factoring x, x-1, and x+1 out of fp(x), we are left with an irreducible polynomial.
|
|
REFERENCES
|
Peter Borwein, Computational excursions in analysis and number theory, Springer-Verlag, 2002, Chap.5.
|
|
LINKS
|
|
|
MATHEMATICA
|
t={}; Do[poly=JacobiSymbol[Range[0, p-1], p].x^Range[0, p-1]; FactorOut[0]; FactorOut[1]; FactorOut[1]; FactorOut[ -1]; c=CountRoots[poly, {x, 0, 1}]; If[c>0, AppendTo[t, p]], {p, Prime[Range[PrimePi[1000]]]}]; t
|
|
PROG
|
(PARI) Fekete(p)=Pol(vector(p, a, kronecker(a, p)))
is(p)=my(x='x, P=Fekete(p)/x); P/=(x-1)^valuation(P, x-1); polsturm(P, [0, 1])>0 \\ Charles R Greathouse IV, Nov 12 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|