Erdős Problem #345 — Let A⊆ N be a complete sequence, and define the threshold of completeness T(A) to be the least integer m such that all n≥ m are in…
Statement
Let be a complete sequence, and define the threshold of completeness to be the least integer such that all are in (the existence of is guaranteed by completeness). Is it true that there are infinitely many such that ?
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.