×

# Sum and Difference Replacement

I have a list of non-negative integers on a whiteboard. Every second, I pick two integers $$a$$ and $$b$$ from the list (where $$a\ge b$$), and replace them with $$a+b$$ and $$a-b$$.

Prove that one of the numbers will be $$\ge X$$ in a finite amount of time, given any arbitrary integer $$X$$. In other words, prove that the numbers on the blackboard increase without bound.

Note by Daniel Liu
3 years, 7 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Every second the sum of all of the numbers on the board increases by $$a-b\ge 0$$. It's easy to convince yourself that it is impossible for the sum to increase by nothing (in other words, have $$a=b$$) for an arbitrarily long amount of time, so I'll leave that as an exercise. Thus the sum of all of the terms increase without bound. Also, it's trivial that there will never be a negative term, that is, at all times, each term must be nonnegative. Since the sum of all of the terms increases without bound, so does the lower bound on the largest term, thus the statement is proven.

- 3 years, 7 months ago

Your result is not quite correct. If there are two zeros on the whiteboard, then you can keep performing the operation on the two zeros, and the numbers never change.

- 3 years, 7 months ago

If we can prove the condition for two arbitrary integers, then you can extend the logic to any other pairs of integers in the set.

$$\textbf{Case 1: }a\neq b$$

The two numbers at the start have a sum of $$a+b,$$ which is one of the new numbers. The second set of numbers has a sum of $$2a.$$ $$2a>a+b\Rightarrow a>b,$$ which is one of the conditions of the problem.

The second iteration will produce the numbers $$2a$$ and $$2b,$$ which are both greater than the original $$a$$ and $$b.$$ Each number will double every two iterations.

$$\textbf{Case 2: }a=b$$

The numbers are $$a$$ and $$a.$$ The first iteration yields $$2a$$ and $$0.$$ The second iteration yields $$2a$$ and $$2a.$$ Once again, both numbers will double every two iterations.

Cases $$1$$ and $$2$$ can be combined, but I split them up to demonstrate it for what most people would try first: unequal numbers.

It is worth noting that this is not true if all of the numbers in the set are $$0.$$

- 3 years, 7 months ago

Can you explain how you would generalize it for a group of integers? What if you did the operation on two numbers $$a$$ and $$b$$, and then did the second operation on some other pair, like $$a-b$$ and $$c$$?

- 3 years, 7 months ago