Let {ai}i=1m and {bi}i=1n be non-negative integer sequences such that all elements in {ai}i=1m∪{bi}i=1n are pairwise distinct.
Prove there are no solutions to i=1∑maiai=i=1∑nbibi
Source: Own
Hints can be found on my AoPS thread
#Sequences
#Power
#Proofs
#Solutions
#Summing
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Because I love rephrasing problems:
Imagine an infinite set of weights, having the weights 11,22,33,44,… units of weight, one of each. You have a two-pan balance. You want to put some number of weights on each pan such that the two pans balance. Prove that the only solution is to leave both pans empty.