Erdős Problem #276 — Is it possible for a Lucas sequence to have all terms composite without having an underlying system of covering congruences responsible?
Statement
Is it possible for a Lucas sequence to have all terms composite having an underlying system of covering congruences responsible? (In other words, no positive integer has a common factor with every term of the sequence).
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.