Let . For any , define , that is, exactly one element from is replaced with the sum of the other two elements. For how many values of does ?
For example, if and , there would be two values of that would contain the set , and your answer would be 2.
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.
Note that S 1 has two odd numbers (1 and 3) and one even number (2). We then have two cases:
Case 1.
We replace the even number with the sum of the other two odd numbers.
Then, the replacement number would stay even.
Case 2.
We replace one of the odd numbers with the sum of the other two numbers.
Then, the replacement would be the sum of an even and odd number, which yields an odd number.
Therefore, no matter what numbers we replace, we'll always have two odd numbers and one even number.
It is easy to see that the set [ 1 2 3 4 , 2 3 4 5 , 3 4 5 6 ] has two even numbers, so it is impossible to obtain.
Hence, the number of possible values for n that would satisfy S n = [ 1 2 3 4 , 2 3 4 5 , 3 4 5 6 ] is 0