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

  • Context: MHB 
  • Thread starter Thread starter lfdahl
  • Start date Start date
  • Tags Tags
    Binary
Click For Summary

Discussion Overview

The discussion revolves around proving that the binary number \( b = 0.11\ldots1 \) with 2003 ones satisfies the inequality \( 0.99\ldots9 < b < 0.99\ldots9 \), where the lower bound has 602 decimal digits of 9 and the upper bound has 603 decimal digits of 9. The scope includes mathematical reasoning and proof techniques.

Discussion Character

  • Mathematical reasoning, Debate/contested

Main Points Raised

  • Post 1 presents the main assertion that the binary number \( b \) falls within the specified bounds.
  • Post 3 expresses uncertainty about the validity of a solution derived using a calculator, while still maintaining confidence in its correctness.
  • Post 4 reiterates the uncertainty regarding the calculator-based solution but also expresses confidence in its validity.
  • Post 2 acknowledges a contribution from another participant without detailing the content of that contribution.
  • Post 4 further supports another participant's solution, indicating agreement with the deductive steps presented.

Areas of Agreement / Disagreement

Participants express varying levels of confidence in their solutions, with some uncertainty regarding the use of calculators for proving the assertion. There is no clear consensus on the validity of the calculator-based approaches.

Contextual Notes

Some participants rely on approximations from calculators, which may introduce limitations in the rigor of their proofs. The discussion does not resolve whether these approximations are acceptable within the context of the proof.

lfdahl
Gold Member
MHB
Messages
747
Reaction score
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
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:
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)
 
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:
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}\]
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
32
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 33 ·
2
Replies
33
Views
7K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K