Erdős's conjecture on Sidon bases of order 3

At least 10 years old · documented by

A sequence of positive integers is a Sidon sequence if all sums a+a′a+a' with a,a′a,a' in the sequence and a≤a′a\leq a' are distinct; it is an asymptotic basis of order gg if every sufficiently large positive integer is a sum of gg elements of the sequence. Erdős's conjecture. There exists a sequence of positive integers that is a Sidon basis of order 33. This is an open problem in additive number theory. The paper proves polynomial-ring analogues over finite fields, but does not resolve the integer conjecture.

References

Primary source

Wentang Kuo and Shuntaro Yamagishi, “Sidon basis in polynomial rings over finite fields”, arXiv:1510.07000 (2015).

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

No solutions have been posted yet.