Abstract
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integers with the distinct sums less or equal to k. The paper shows that this bound is tight.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
