ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ϕ\phi denote Euler's totient function, and let nn be an odd integer greater than five. Consider integers x,yx,y that are non-negative. The system below is supplemented by a congruence modulo 33:

{ϕ(n−x−y)+1=n−x−yϕ(2x−n)+1=2x−nϕ(n−x+y)+1=n−x+y(n−x−y)(2x−n)≡0(mod3)\begin{cases} \phi(n-x-y)+1=n-x-y \\ \phi(2x-n)+1=2x-n \\ \phi(n-x+y)+1=n-x+y \\ (n-x-y)(2x-n) \equiv 0 \pmod{3} \end{cases}

Euler's totient formulation of the ternary Goldbach theorem with a congruence. The system has a solution (x,y)(x,y) in non-negative integers for every odd integer nn greater than five. The preceding theorem in the supplied text gives the same three totient equations without the congruence and identifies it with the ternary Goldbach theorem, which is stated there as a theorem and attributed to Helfgott. The text does not state a separate resolution of this strengthened formulation.

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.