Abstract
For a set and , let denote the number of ordered pairs such that . The celebrated Erdős-Turán conjecture says that, if for all sufficiently large integers , then the representation function cannot be bounded. For any positive integer , Ruzsa's number is defined to be the least positive integer such that there exists a set with for all . In 2008, Chen proved that for all positive integers . In this paper, we prove that for all integers . We also determine all values of when .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.