The tau-conjecture on integer roots of straight-line polynomials
Statement
For , define as the least for which occurs in a sequence beginning with and , with each later polynomial obtained from two earlier ones by addition, subtraction, or multiplication. Let be the number of distinct integer zeros of . The -conjecture. There is a constant such that
for every . This conjecture would imply that the 20 Questions problem is not in polynomial time; its status is open in the source.
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.