Euler's totient formulation of the ternary Goldbach theorem with a congruence
Statement
Let denote Euler's totient function, and let be an odd integer greater than five. Consider integers that are non-negative. The system below is supplemented by a congruence modulo :
Euler's totient formulation of the ternary Goldbach theorem with a congruence. The system has a solution in non-negative integers for every odd integer 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.