Sharp integer-root bound for binomial-product programs and a tau-convention audit
Statement
Question 16 (Rojas). Consider sequences in Z[x] of the form
1, x, g 1, g 2,...
where each gi is a sum, difference or product of 2 earlier terms in the sequence. Let
τ (f ):= min {n | there exists such a sequence with gn = f }
Conjecture: there exists a constant c such that the number of integer zeros of f is at most (1 + τ (f ))c, where f is not identically zero.
Record
- Source
- Added
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.