arXiv:2611.17584v1 Announce Type: new Abstract: We prove that the $n$-th element of the Ulam sequence, a somewhat mysterious recursively-defined sequence of positive integers, has size $e^{O(\sqrt{n})}$; previous upper bounds were exponential in $n$. Our argument uses an additive-combinatorial lemma, possibly of independent interest, about covering finite difference sets with multiplicatively short intervals. The proofs are due to ChatGPT.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page