erdős #675
We say that has the translation property if, for every , there exists some integer such that, for all , Does the set of the sums of two squares have the translation property? If we partition all primes into , such that each set contains many primes for all large , then can the set of integers only divisible by primes from have the translation property? If is the set of squarefree numbers then how fast does the minimal such grow? Is it true that for some constant ?
Worked, still open.
number theory · open · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
These three questions are exactly the “Translation Properties” problem posed by Erdős (1979), and (at least in the form you’ve stated) the first two parts are still open.
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗links
Create a formalisation here · link
status
open