Erdős Problem #424
Proves positive lower density. The Formal Conjectures encoding asks for Set.HasPosDensity, a density that exists and is positive; erdosproblems.com says Erdos most likely meant lower density.
number-theory / Number Theory, Integer Sequences
Let $a_1 = 2$ and $a_2 = 3$ and continue the sequence by appending to $a_1, \dots, a_n$ all possible values of $a_ia_j - 1$ with $i \ne j$. Is it true that the set of integers which eventually appear has positive density?
Temporal state
No reconciled state yet.
Append-only history
Proves positive lower density. The Formal Conjectures encoding asks for Set.HasPosDensity, a density that exists and is positive; erdosproblems.com says Erdos most likely meant lower density.
Research memory
Let $a_1 = 2$ and $a_2 = 3$ and continue the sequence by appending to $a_1, \dots, a_n$ all possible values of $a_ia_j - 1$ with $i \ne j$. Is it true that the set of integers which eventually appear has positive density?
Proves positive lower density. The Formal Conjectures encoding asks for Set.HasPosDensity, a density that exists and is positive; erdosproblems.com says Erdos most likely meant lower density.
Evidence graph
No public relationships recorded yet.