If you can place either a or between each consecutive number from through , find the number of arrangements that will result in an even sum.
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.
When there are an even number of operators, the last added term was even. If the sum is even, then one of four things can happen to get to the next added even term: + odd + even which makes odd, + odd × even which makes even, × odd + even which makes even, and × odd × even which makes even. If the sum is odd, then one of four things can happen to get to the next added even term: + odd + even which makes even, + odd × even which makes odd, × odd + even which makes odd, and × odd × even which makes odd.
Therefore, 3 even sums will be obtained from a previous even sum, and 1 even sum will be obtained from a previous odd sum, so that if e n is the number of even sums and o n is the number of odd sums for n number of operators, e n = 3 e n − 2 + o n − 2 . Since the evens and odds add up to a power of 2 , e n − 2 + o n − 2 = 2 n − 2 . Substituting this in gives e n = 3 e n − 2 + ( 2 n − 2 − e n − 2 ) or e n = 2 e n − 2 + 2 n − 2 , which can inductively be shown to be the explicit equation e n = 2 2 n − 1 ( 2 2 n + 1 ) for e 0 = 1 .
For consecutive numbers 2 through 3 0 , there are n = 3 0 − 2 = 2 8 operators. Therefore, the number of even sums is e 2 8 = 2 2 2 8 − 1 ( 2 2 2 8 + 1 ) = 1 3 4 2 2 5 9 2 0 .