TOPICS
Search

Square-Difference-Free Set


A square-difference-free set is a set of integers in which the absolute difference between any two distinct members is not a positive square number. For example, {1,3,6} is square-difference-free, whereas {1,5} is not.

The Furstenberg-Sárközy theorem implies that the maximum size s(N) of a square-difference-free subset of {1,2,...,N} satisfies s(N)=o(N).


See also

Furstenberg-Sarkoezy Theorem, Intersective Polynomial, Square Number

Explore with Wolfram|Alpha

References

Rice, A. "Sárközy's Theorem for P-Intersective Polynomials." Acta Arith. 157, 69-89, 2013. https://doi.org/10.4064/aa157-1-4.

Cite this as:

Weisstein, Eric W. "Square-Difference-Free Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Square-Difference-FreeSet.html

Subject classifications