Let S be the set of all real numbers that can be represented as where for any natural number Then the answer for each of the following three questions is "Yes" or "No".
Question 1. Is ?
Question 2. If a number can be represented by the formula (*), is this representation unique?
Question 3. Can the number be represented in the form (*) and for at least one possible representation of that number?
Pick the right sequence of answers corresponding to these questions
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.
The correct sequence of answers is "Yes", "No", "Yes". Let us see the proof of any of these answers.
Question 1. The answer is "Yes".
Proof: If x can be represented by the formula (*) then − 1 = ∑ k = 1 ∞ 2 k − 1 ≤ x ≤ ∑ k = 1 ∞ 2 k 1 = 1 , then x ∈ [ − 1 , 1 ] .
Now we can prove the converse implication: x ∈ [ − 1 , 1 ] ⇒ x ∈ S . If x = − 1 or x = 1 , then x can be represented as ∑ k = 1 ∞ 2 k − 1 or ∑ k = 1 ∞ 2 k 1 . respectively. Therefore, in this case, x ∈ S . Let us consider now the case when x ∈ [ 0 , 1 ) , then using the binary representation x = ∑ k = 1 ∞ 2 k b k , where b k is 1 or 0 for any natural number k. Then 2 x = ∑ k = 1 ∞ 2 k 2 b k Subtracting 1 from both sides of this equation and using that 1 = ∑ k = 1 ∞ 2 k 1 , we get that 2 x − 1 = k = 1 ∑ ∞ 2 k 2 b k − k = 1 ∑ ∞ 2 k 1 = k = 1 ∑ ∞ 2 k 2 b k − 1 = ( 2 b k − 1 ) = 1 ∑ 2 k 1 + ( 2 b k − 1 ) = − 1 ∑ 2 k − 1 Now, adding 1 to both sides of the equation, 2 x = 1 + ( 2 b k − 1 ) = 1 ∑ 2 k 1 + ( 2 b k − 1 ) = − 1 ∑ 2 k − 1 Finally, we divide both sides by 2, x = 2 1 + ( 2 b k − 1 ) = 1 ∑ 2 k + 1 1 + ( 2 b k − 1 ) = − 1 ∑ 2 k + 1 − 1 and this is a possible representation of x in the form given by the formula (*).
If x ∈ ( − 1 , 0 ) , then − x ∈ ( 0 , 1 ) . Since − x can be expressed in the form (*), then it is easy to see that x is also representable in that form.
Question 2. The answer is "No".
Proof: Notice that 4 1 = ∑ k = 3 ∞ 2 k 1 . Then 2 1 = 2 1 + 4 1 − k = 3 ∑ ∞ 2 k 1 = 2 1 − 4 1 + k = 3 ∑ ∞ 2 k 1 . So, the number 2 1 is an example of a number with two distinct representations in the form (*).
Question 3 . The answer is "Yes".
Proof: Let x = − 3 2 2 1 . Then it is easy to see that − x = 2 1 + 2 3 1 + 2 5 1 Multiplying by 2, 2 ( − x ) = 2 2 + 2 3 2 + 2 5 2 , Subtracting 1 and using that 1 = ∑ k = 1 ∞ 2 k 1 , 2 ( − x ) − 1 = 2 1 + 2 2 − 1 + 2 3 1 + 2 4 − 1 + 2 5 1 − k = 6 ∑ ∞ 2 k 1 . Hence, solving for − x , as we did in the proof in question 1, − x = 2 1 + 2 2 1 + 2 3 − 1 + 2 4 1 + 2 5 − 1 + 2 6 1 − k = 6 ∑ ∞ 2 k + 1 1 , and, therefore, x = 2 − 1 + 2 2 − 1 + 2 3 1 + 2 4 − 1 + 2 5 1 + 2 6 − 1 + k = 6 ∑ ∞ 2 k + 1 1 .
Then, for this representation of x , we have obtained that a 1 = − 1 , a 2 = − 1 , a 3 = 1 , a 4 = − 1 , a 5 = 1 . Therefore, that the sum a 1 + a 2 + a 3 + a 4 + a 5 = − 1 . This completes the proof that the answer to this question is "Yes."