ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ϕ\phi denote Euler's totient function. For every natural number nn distinct from unity, seek integral solutions xx to the displayed system

{ϕ(n−x)+1=n−xϕ(n+x)+1=n+x\begin{cases} \phi(n-x)+1=n-x \\ \phi(n+x)+1=n+x \end{cases}

Euler's totient formulation of the binary Goldbach conjecture. The system has an integral solution for every natural number nn distinct from unity. This is presented as an alternative formulation of the binary Goldbach conjecture, which asserts that every even integer 2n2n, n>1n>1, is a sum of two primes. The supplied text does not establish the conjecture itself or provide evidence that this formulation has been resolved.

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.