Skolem problem
Statement
For an integer , integer coefficients , and integer initial values , let be the sequence determined by
and let
be its set of zero positions.
There exists an algorithm which, given as input the order , the coefficients and the initial values (each written in binary), terminates and outputs whether
i.e. whether .
The same assertion is made for recurrences whose coefficients and initial values are rational numbers given as ratios of binary integers, and for recurrences whose coefficients and initial values are algebraic numbers, each specified by its minimal polynomial over together with an isolating rational approximation.
Record
- 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.