Sierpiński's conjecture on the number of solutions to Euler's totient equation
Statement
Let denote Euler's totient function. For an integer , consider the equation in positive integers . Sierpiński's conjecture. For any integer , there exists an integer such that the equation has exactly solutions. Ford proved this conjecture in 1998, after Ford and Konyagin had proved it for even integers; it is therefore a solved conjecture.
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.