Three odd Gaussian primes conjecture for the first quadrant
Three odd Gaussian primes conjecture for the first quadrant
Let , and let . Three odd Gaussian primes conjecture. For every with , the Gaussian integer is a sum of at most three odd primes from . This is motivated by computational experiments on representations of Gaussian integers; the source gives no proof or resolution.
Sources & referencesView supporting material
Primary source
Felix Sidokhine, “Shnirelman's Theorem Applications”, arXiv:2001.00063 (2019).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.