2000 character limit reached
An elementary conjecture which implies the Goldbach conjecture
Published 1 Feb 2018 in math.GM | (1802.02428v1)
Abstract: Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which is greater than or equal to $p_{k}$. In this brief note, we observe that Goldbach's conjecture follows from this conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.