Erdős Problem #892
Statement
Is there a necessary and sufficient condition for a sequence of integers that ensures there exists a primitive sequence (i.e. no element divides another) with for all ? In particular, is this always possible if there are no non-trivial solutions to ?
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.