ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each positive integer NN, let FNF_N be the polynomial defined from the indicator function of the odd primes by

FN(z)=∑k=0N−1(∑n=1N−1χP(n)zkn)2.F_N(z)=\sum_{k=0}^{N-1}\left(\sum_{n=1}^{N-1}\chi_{\mathcal P}(n)z^{kn}\right)^2.

Let φ\varphi denote Euler's totient function. Unit-circle roots conjecture for the Goldbach polynomials. If N>5N>5 is an integer, then FNF_N has precisely 2φ(N)2\varphi(N) roots on the unit circle. The paper presents this as a strengthening of Goldbach's conjecture, supported by numerical evidence; the cyclotomic divisibility results already guarantee the stated minimum number of unit-circle roots.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.