Show that the binary number b=0.11…1 with 2003 1’s satisfies 0.99⋅⋅⋅9<b<0.99…9

  • MHB
  • Thread starter lfdahl
  • Start date
  • Tags
    Binary
In summary, the binary number $b = 0.11...1$ with $2003$ $1$'s satisfies the inequality $0.99...9 < b < 0.99...9$, where the lower bound has $602$ decimal digits $9$ and the upper bound has $603$ decimal digits $9$. Both contributors, HallsofIvy and johng, have provided acceptable solutions, with johng using a calculator to prove the assertion.
  • #1
lfdahl
Gold Member
MHB
749
0
Show that the binary number $b = 0.11 … 1$ with $2003$ $1$’s satisfies

$0.99 ··· 9 < b < 0.99…9$, where the lower bound has $602$ decimal digits $9$,

whereas the upper bound has $603$ decimal digits $9$.
 
Mathematics news on Phys.org
  • #2
b= 1/2+ 1/4+ ...+ 1/2^{2003}= (1/2)(1+ 1/2+ ...+ 1/2^{2002}

That's a finite geometric sequence. For the general finite geometric sequence S(N)= 1+ a+ a^2+ ...+ a^N, we can write S(N)- 1= a+ a^2+ ...+ a^{N-1}= a(1+ a+ a^2+ a^{N-1}). Add and subtract a^N inside the last parenthese: S(N)- 1= a(1+ a+ a^2+ ...+ a^{N-1}+ a^N- a^N)= a(1+ a+ ^2+ ...+ a^{N-1}+ a^N)- a^{N+1}= aS(N)- a^{N+1}.

That is, S(N)- 1= aS(N)- a^{N+1} so S(N)- aS(N)= (1- a)S(N)= 1- a^{N+1}. S(N)= (1- a^{N+1})/(1- a).

With a= 1/2 and N= 2002, That is (1- 1/2^{2003})/(1- 1/2= 2(1- 1/2^{2003})

b is 1/2 that, 1- 1/2^{2003}
 
Last edited by a moderator:
  • #3
HallsofIvy said:
b= 1/2+ 1/4+ ...+ 1/2^{2003}= (1/2)(1+ 1/2+ ...+ 1/2^{2002}

That's a finite geometric sequence. For the general finite geometric sequence S(N)= 1+ a+ a^2+ ...+ a^N, we can write S(N)- 1= a+ a^2+ ...+ a^{N-1}= a(1+ a+ a^2+ a^{N-1}). Add and subtract a^N inside the last parenthese: S(N)- 1= a(1+ a+ a^2+ ...+ a^{N-1}+ a^N- a^N)= a(1+ a+ ^2+ ...+ a^{N-1}+ a^N)- a^{N+1}= aS(N)- a^{N+1}.

That is, S(N)- 1= aS(N)- a^{N+1} so S(N)- aS(N)= (1- a)S(N)= 1- a^{N+1}. S(N)= (1- a^{N+1})/(1- a).

With a= 1/2 and N= 2002, That is (1- 1/2^{2003})/(1- 1/2= 2(1- 1/2^{2003})

b is 1/2 that, 1- 1/2^{2003}

Thankyou, HallsofIvy for your contribution,

- which is an important step in the suggested solution, but you still need to consider how to represent the two bounds in an adequate manner and to ensure the validity of the two inequalities. You can make it, I´m sure (Nod)
 
  • #4
This may not be an acceptable solution since I used my calculator, but I'm quite confident that my calculator with its approximations still proves the assertion.

0.999.. < b < 0.999.. if and only if
1 - 0.999.. > 1 - b > 1 - 0.999.. if and only if
$(1/10)^{602}>(1/2)^{2003}>(1/10)^{603}$ if and only if
$602\ln(10)<2003\ln(2)<603\ln(10)$ if and only if
$602/2003<\ln(2)/\ln(10)<603/2003$. According to my calculator, this is saying:
$0.300549<0.301030<0.301048$
 
Last edited by a moderator:
  • #5
johng said:
This may not be an acceptable solution since I used my calculator, but I'm quite confident that my calculator with its approximations still proves the assertion.

0.999.. < b < 0.999.. if and only if
1 - 0.999.. > 1 - b > 1 - 0.999.. if and only if
$(1/10)^{602}>(1/2)^{2003}>(1/10)^{603}$ if and only if
$602\ln(10)<2003\ln(2)<603\ln(10)$ if and only if
$602/2003<\ln(2)/\ln(10)<603/2003$. According to my calculator, this is saying:
$0.300549<0.301030<0.301048$

Thankyou, johng, for your solution, which, I think, is fully acceptable, since your deductive steps
all correlate with the suggested solution:

\[0.301 < \log_{10}2 < 0.30103 \\\\ 602 < 2003 \log_{10}2 < 603 \\\\ 10^{602} < 2^{2003} < 10^{603} \\\\ 1-10^{-602} < 1-2^{-2003} < 1 - 10^{-603}\\\\ 0.\underbrace{999..9}_{602} < (0.\underbrace{111..1}_{2003})_2 < 0.\underbrace{999..9}_{603}\]
 

FAQ: Show that the binary number b=0.11…1 with 2003 1’s satisfies 0.99⋅⋅⋅9<b<0.99…9

What is a binary number?

A binary number is a number expressed in the base-2 numeral system, which uses only two digits (0 and 1) to represent all values.

How can we show that the binary number b=0.11…1 with 2003 1’s satisfies 0.99⋅⋅⋅9

To show this, we can use the concept of limits in mathematics. We can take the limit of the binary number b as the number of 1's approaches infinity, and we will see that the value of b will approach 0.999...9, which satisfies the given inequality.

Why is it important to show that b=0.11…1 with 2003 1’s satisfies 0.99⋅⋅⋅9

This is important because it demonstrates the concept of infinite series and how they can be used to represent numbers. It also highlights the fact that even though the binary number b may seem to have an infinite number of 1's, it can still be compared to other numbers within a given range.

What other mathematical concepts are related to this question?

This question is related to the concepts of infinite series, limits, and number representation in different numeral systems.

How can this concept be applied in real-world situations?

This concept can be applied in various fields such as computer science, where binary numbers are used to represent and manipulate data, and in finance, where infinite series are used in the calculation of interest rates and investments.

Similar threads

Replies
7
Views
545
Replies
3
Views
2K
Replies
1
Views
1K
Replies
33
Views
6K
Replies
17
Views
1K
Replies
5
Views
1K
Replies
1
Views
2K

Back
Top