Even It Out 2

If you can place either a + + or × \times between each consecutive number from 2 2 through 30 30 , find the number of arrangements that will result in an even sum.

2 __ 3 __ 4 __ . . . __ 28 __ 29 __ 30 2 \text{ \_\_ } 3 \text{ \_\_ } 4 \text{ \_\_ } ... \text{ \_\_ } 28 \text{ \_\_ } 29 \text{ \_\_ } 30

Inspiration


The answer is 134225920.

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.

1 solution

David Vreken
May 8, 2019

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 × \times even which makes even, × \times odd + + even which makes even, and × \times odd × \times 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 × \times even which makes odd, × \times odd + + even which makes odd, and × \times odd × \times even which makes odd.

Therefore, 3 3 even sums will be obtained from a previous even sum, and 1 1 even sum will be obtained from a previous odd sum, so that if e n e_n is the number of even sums and o n o_n is the number of odd sums for n n number of operators, e n = 3 e n 2 + o n 2 e_n = 3e_{n - 2} + o_{n - 2} . Since the evens and odds add up to a power of 2 2 , e n 2 + o n 2 = 2 n 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 ) e_n = 3e_{n - 2} + (2^{n - 2} - e_{n - 2}) or e n = 2 e n 2 + 2 n 2 e_n = 2e_{n - 2} + 2^{n - 2} , which can inductively be shown to be the explicit equation e n = 2 n 2 1 ( 2 n 2 + 1 ) e_n = 2^{\frac{n}{2} - 1}(2^{\frac{n}{2}} + 1) for e 0 = 1 e_0 = 1 .

For consecutive numbers 2 2 through 30 30 , there are n = 30 2 = 28 n = 30 - 2 = 28 operators. Therefore, the number of even sums is e 28 = 2 28 2 1 ( 2 28 2 + 1 ) = 134225920 e_{28} = 2^{\frac{28}{2} - 1}(2^{\frac{28}{2}} + 1) = \boxed{134225920} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...