Hello,(adsbygoogle = window.adsbygoogle || []).push({});

I would like to see a solution to the following problem:

Let A be a finite collection of natural numbers. Consider the set of the pairwise sums of each of the numbers in A, which I will denote by S(A). For example, if A={2,3,4}, then S(A)={5,6,7}. Prove that if S(A)=S(B) for two different finite sets of natural numbers A and B, then |A|=|B|, and |A|=|B| is a power of 2.

I find this problem interesting, but I am working on other problems. Anyone have ideas?

Thanks,

Mathguy

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Combinatorial Number Theory Problem

Loading...

Similar Threads - Combinatorial Number Theory | Date |
---|---|

A Last Gauss Lemma Section II | Feb 4, 2018 |

Generalization of combinatorial generating functions? | Dec 31, 2014 |

Combinatorial design problem | Nov 13, 2012 |

A seemingly simple combinatorial problem | Sep 22, 2009 |

Combinatorial Matrix problem - REALLY NEAT! | Jan 23, 2008 |

**Physics Forums - The Fusion of Science and Community**