Given
A = 1 + 3 + 5 + . . . + 2 0 2 1
B = 2 + 4 + 6 + . . . + 2 0 2 0
We can say...
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I found a pattern for both A and B.
I applied them, and for A, I got 1 0 1 1 1 0 1 1 = 1 022 121.
For B, I got 1 0 1 0 × 1 0 1 1 = 1 021 110.
Obviously, 1 022121 > 1 021 110 .
Therefore, A > B
Each number in B is 1 higher than some number in A and these pair off with each number in A except 2 0 2 1 , so B > A − 2 0 2 1 .
Next, note that there are 1 0 1 0 of these pairs, each making B larger by 1 , so we get B = A − 2 0 2 1 + 1 0 1 0 .
This boils down to B = A − 1 0 1 1 or just B < A .
We can write,
A = 1 + 3 + 5 + . . . + 2 0 2 1 = 1 0 1 0 ² + 2 0 2 1
B = 2 + 4 + 6 + . . . + 2 0 2 0 = 1 0 1 0 ² + 1 0 1 0
So, A > B
Problem Loading...
Note Loading...
Set Loading...
B A ⟹ B − A = 2 + 4 + 6 + ⋯ + 2 0 2 0 = 1 + 3 + 5 + ⋯ + 2 0 1 9 + 2 0 2 1 = 1 0 1 0 × 1 1 + 1 + 1 + ⋯ + 1 − 2 0 2 1 = 1 0 1 0 − 2 0 2 1 = − 1 0 1 1
Therefore, A > B .