Consecutive zeros in the binary representation of $sqrt3$

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
7
down vote

favorite












$sqrt3=1.b_1b_2...$is the binary representation of $sqrt3$.



i.e. $sqrt3=1+dfracb_12^1+dfracb_22^2+...$



Prove that at least one of the digits $b_n,b_n+1,...,b_2n$ is 1.



my attempt:



Square both sides: $$left(1+sum_i=1^inftyfracb_i2^iright)^2=3$$
Expand and subtract $1$ from both sides
$$2sum_i=1^inftyfracb_i2^i+sum_i=1^inftyfracb_i^22^2i=2$$
divide both side by 2
$$sum_i=1^inftyfracb_i2^i+sum_i=1^inftyfracb_i^22^2i+1=1$$
Tidy up
$$sum_i=1^inftyfrac12^ileft(b_i+fracb_i^22^i+1right)=1$$
Lemma: $displaystylesum_i=m^inftyfrac12^ileft(1+frac12^i+1right)<frac12^m-2$



Proof: multiply both side by $2^m-1$$$sum_i=1^inftyfrac12^i+frac12^m+1+i<2$$which is trivial for any positive integer m.



Proceed the proof by contradiction: suppose $b_n,b_n+1,...b_2n$ are all equal to $0$. Then the sum $sum_i=1^n-1frac12^ileft(b_i+fracb_i^22^i+1right)$ is in the form of $1-fracx2^2n-1$.



But $$sum_i=2n+1^inftyfrac12^ileft(b_i+fracb_i^22^i+1right)<frac12^2n-1$$by lemma.



Q.E.D.



Is this proof correct?
I am also happy for an alternative (and hopefully shorter) solution.










share|cite|improve this question























  • How do you go from $left(1+sumlimits_j=1^infty 2^-jb_jright)^2=3$ to $2sumlimits_j=1^infty 2^-jb_j+sumlimits_j=1^infty 2^-2jb_j^2=2$? Because I did the same thing and I have ended up with $$2sum_j=1^infty 2^-jb_j+left(sum_j=1^infty 2^-jb_jright)^2=2.$$
    – Saucy O'Path
    Sep 9 at 8:35







  • 2




    Note that $$Big(1+sum_i=1^infty fracb_i2^iBig)^2 = 1+2sum_i=1^inftyfracb_i2^i+colorred2sum_i,j=1^inftyfracb_i b_j2^i+j+sum_i=1^infty fracb_i^22^2i,$$ where the red term is missing in your computations.
    – M. Winter
    Sep 9 at 8:39










  • Ooops... looks like I made a mistake.
    – abc...
    Sep 9 at 8:47










  • @M. Winter, thanks for pointing out my mistake. If I cannot see properly OP on the screen of my smartphone, I should not edit answers :)
    – Maam
    Sep 9 at 8:52










  • (To the OP) Note that it is best to avoid use of MathJax in titles as that prevents the questions from appearing in the Hot Network and reduces their searchability on platforms like Google. See my edit.
    – Devashish Kaushik
    Sep 9 at 9:16















up vote
7
down vote

favorite












$sqrt3=1.b_1b_2...$is the binary representation of $sqrt3$.



i.e. $sqrt3=1+dfracb_12^1+dfracb_22^2+...$



Prove that at least one of the digits $b_n,b_n+1,...,b_2n$ is 1.



my attempt:



Square both sides: $$left(1+sum_i=1^inftyfracb_i2^iright)^2=3$$
Expand and subtract $1$ from both sides
$$2sum_i=1^inftyfracb_i2^i+sum_i=1^inftyfracb_i^22^2i=2$$
divide both side by 2
$$sum_i=1^inftyfracb_i2^i+sum_i=1^inftyfracb_i^22^2i+1=1$$
Tidy up
$$sum_i=1^inftyfrac12^ileft(b_i+fracb_i^22^i+1right)=1$$
Lemma: $displaystylesum_i=m^inftyfrac12^ileft(1+frac12^i+1right)<frac12^m-2$



Proof: multiply both side by $2^m-1$$$sum_i=1^inftyfrac12^i+frac12^m+1+i<2$$which is trivial for any positive integer m.



Proceed the proof by contradiction: suppose $b_n,b_n+1,...b_2n$ are all equal to $0$. Then the sum $sum_i=1^n-1frac12^ileft(b_i+fracb_i^22^i+1right)$ is in the form of $1-fracx2^2n-1$.



But $$sum_i=2n+1^inftyfrac12^ileft(b_i+fracb_i^22^i+1right)<frac12^2n-1$$by lemma.



Q.E.D.



Is this proof correct?
I am also happy for an alternative (and hopefully shorter) solution.










share|cite|improve this question























  • How do you go from $left(1+sumlimits_j=1^infty 2^-jb_jright)^2=3$ to $2sumlimits_j=1^infty 2^-jb_j+sumlimits_j=1^infty 2^-2jb_j^2=2$? Because I did the same thing and I have ended up with $$2sum_j=1^infty 2^-jb_j+left(sum_j=1^infty 2^-jb_jright)^2=2.$$
    – Saucy O'Path
    Sep 9 at 8:35







  • 2




    Note that $$Big(1+sum_i=1^infty fracb_i2^iBig)^2 = 1+2sum_i=1^inftyfracb_i2^i+colorred2sum_i,j=1^inftyfracb_i b_j2^i+j+sum_i=1^infty fracb_i^22^2i,$$ where the red term is missing in your computations.
    – M. Winter
    Sep 9 at 8:39










  • Ooops... looks like I made a mistake.
    – abc...
    Sep 9 at 8:47










  • @M. Winter, thanks for pointing out my mistake. If I cannot see properly OP on the screen of my smartphone, I should not edit answers :)
    – Maam
    Sep 9 at 8:52










  • (To the OP) Note that it is best to avoid use of MathJax in titles as that prevents the questions from appearing in the Hot Network and reduces their searchability on platforms like Google. See my edit.
    – Devashish Kaushik
    Sep 9 at 9:16













up vote
7
down vote

favorite









up vote
7
down vote

favorite











$sqrt3=1.b_1b_2...$is the binary representation of $sqrt3$.



i.e. $sqrt3=1+dfracb_12^1+dfracb_22^2+...$



Prove that at least one of the digits $b_n,b_n+1,...,b_2n$ is 1.



my attempt:



Square both sides: $$left(1+sum_i=1^inftyfracb_i2^iright)^2=3$$
Expand and subtract $1$ from both sides
$$2sum_i=1^inftyfracb_i2^i+sum_i=1^inftyfracb_i^22^2i=2$$
divide both side by 2
$$sum_i=1^inftyfracb_i2^i+sum_i=1^inftyfracb_i^22^2i+1=1$$
Tidy up
$$sum_i=1^inftyfrac12^ileft(b_i+fracb_i^22^i+1right)=1$$
Lemma: $displaystylesum_i=m^inftyfrac12^ileft(1+frac12^i+1right)<frac12^m-2$



Proof: multiply both side by $2^m-1$$$sum_i=1^inftyfrac12^i+frac12^m+1+i<2$$which is trivial for any positive integer m.



Proceed the proof by contradiction: suppose $b_n,b_n+1,...b_2n$ are all equal to $0$. Then the sum $sum_i=1^n-1frac12^ileft(b_i+fracb_i^22^i+1right)$ is in the form of $1-fracx2^2n-1$.



But $$sum_i=2n+1^inftyfrac12^ileft(b_i+fracb_i^22^i+1right)<frac12^2n-1$$by lemma.



Q.E.D.



Is this proof correct?
I am also happy for an alternative (and hopefully shorter) solution.










share|cite|improve this question















$sqrt3=1.b_1b_2...$is the binary representation of $sqrt3$.



i.e. $sqrt3=1+dfracb_12^1+dfracb_22^2+...$



Prove that at least one of the digits $b_n,b_n+1,...,b_2n$ is 1.



my attempt:



Square both sides: $$left(1+sum_i=1^inftyfracb_i2^iright)^2=3$$
Expand and subtract $1$ from both sides
$$2sum_i=1^inftyfracb_i2^i+sum_i=1^inftyfracb_i^22^2i=2$$
divide both side by 2
$$sum_i=1^inftyfracb_i2^i+sum_i=1^inftyfracb_i^22^2i+1=1$$
Tidy up
$$sum_i=1^inftyfrac12^ileft(b_i+fracb_i^22^i+1right)=1$$
Lemma: $displaystylesum_i=m^inftyfrac12^ileft(1+frac12^i+1right)<frac12^m-2$



Proof: multiply both side by $2^m-1$$$sum_i=1^inftyfrac12^i+frac12^m+1+i<2$$which is trivial for any positive integer m.



Proceed the proof by contradiction: suppose $b_n,b_n+1,...b_2n$ are all equal to $0$. Then the sum $sum_i=1^n-1frac12^ileft(b_i+fracb_i^22^i+1right)$ is in the form of $1-fracx2^2n-1$.



But $$sum_i=2n+1^inftyfrac12^ileft(b_i+fracb_i^22^i+1right)<frac12^2n-1$$by lemma.



Q.E.D.



Is this proof correct?
I am also happy for an alternative (and hopefully shorter) solution.







algebra-precalculus number-theory proof-verification






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Sep 9 at 9:41









M. Winter

18.2k62764




18.2k62764










asked Sep 9 at 8:30









abc...

2,168529




2,168529











  • How do you go from $left(1+sumlimits_j=1^infty 2^-jb_jright)^2=3$ to $2sumlimits_j=1^infty 2^-jb_j+sumlimits_j=1^infty 2^-2jb_j^2=2$? Because I did the same thing and I have ended up with $$2sum_j=1^infty 2^-jb_j+left(sum_j=1^infty 2^-jb_jright)^2=2.$$
    – Saucy O'Path
    Sep 9 at 8:35







  • 2




    Note that $$Big(1+sum_i=1^infty fracb_i2^iBig)^2 = 1+2sum_i=1^inftyfracb_i2^i+colorred2sum_i,j=1^inftyfracb_i b_j2^i+j+sum_i=1^infty fracb_i^22^2i,$$ where the red term is missing in your computations.
    – M. Winter
    Sep 9 at 8:39










  • Ooops... looks like I made a mistake.
    – abc...
    Sep 9 at 8:47










  • @M. Winter, thanks for pointing out my mistake. If I cannot see properly OP on the screen of my smartphone, I should not edit answers :)
    – Maam
    Sep 9 at 8:52










  • (To the OP) Note that it is best to avoid use of MathJax in titles as that prevents the questions from appearing in the Hot Network and reduces their searchability on platforms like Google. See my edit.
    – Devashish Kaushik
    Sep 9 at 9:16

















  • How do you go from $left(1+sumlimits_j=1^infty 2^-jb_jright)^2=3$ to $2sumlimits_j=1^infty 2^-jb_j+sumlimits_j=1^infty 2^-2jb_j^2=2$? Because I did the same thing and I have ended up with $$2sum_j=1^infty 2^-jb_j+left(sum_j=1^infty 2^-jb_jright)^2=2.$$
    – Saucy O'Path
    Sep 9 at 8:35







  • 2




    Note that $$Big(1+sum_i=1^infty fracb_i2^iBig)^2 = 1+2sum_i=1^inftyfracb_i2^i+colorred2sum_i,j=1^inftyfracb_i b_j2^i+j+sum_i=1^infty fracb_i^22^2i,$$ where the red term is missing in your computations.
    – M. Winter
    Sep 9 at 8:39










  • Ooops... looks like I made a mistake.
    – abc...
    Sep 9 at 8:47










  • @M. Winter, thanks for pointing out my mistake. If I cannot see properly OP on the screen of my smartphone, I should not edit answers :)
    – Maam
    Sep 9 at 8:52










  • (To the OP) Note that it is best to avoid use of MathJax in titles as that prevents the questions from appearing in the Hot Network and reduces their searchability on platforms like Google. See my edit.
    – Devashish Kaushik
    Sep 9 at 9:16
















How do you go from $left(1+sumlimits_j=1^infty 2^-jb_jright)^2=3$ to $2sumlimits_j=1^infty 2^-jb_j+sumlimits_j=1^infty 2^-2jb_j^2=2$? Because I did the same thing and I have ended up with $$2sum_j=1^infty 2^-jb_j+left(sum_j=1^infty 2^-jb_jright)^2=2.$$
– Saucy O'Path
Sep 9 at 8:35





How do you go from $left(1+sumlimits_j=1^infty 2^-jb_jright)^2=3$ to $2sumlimits_j=1^infty 2^-jb_j+sumlimits_j=1^infty 2^-2jb_j^2=2$? Because I did the same thing and I have ended up with $$2sum_j=1^infty 2^-jb_j+left(sum_j=1^infty 2^-jb_jright)^2=2.$$
– Saucy O'Path
Sep 9 at 8:35





2




2




Note that $$Big(1+sum_i=1^infty fracb_i2^iBig)^2 = 1+2sum_i=1^inftyfracb_i2^i+colorred2sum_i,j=1^inftyfracb_i b_j2^i+j+sum_i=1^infty fracb_i^22^2i,$$ where the red term is missing in your computations.
– M. Winter
Sep 9 at 8:39




Note that $$Big(1+sum_i=1^infty fracb_i2^iBig)^2 = 1+2sum_i=1^inftyfracb_i2^i+colorred2sum_i,j=1^inftyfracb_i b_j2^i+j+sum_i=1^infty fracb_i^22^2i,$$ where the red term is missing in your computations.
– M. Winter
Sep 9 at 8:39












Ooops... looks like I made a mistake.
– abc...
Sep 9 at 8:47




Ooops... looks like I made a mistake.
– abc...
Sep 9 at 8:47












@M. Winter, thanks for pointing out my mistake. If I cannot see properly OP on the screen of my smartphone, I should not edit answers :)
– Maam
Sep 9 at 8:52




@M. Winter, thanks for pointing out my mistake. If I cannot see properly OP on the screen of my smartphone, I should not edit answers :)
– Maam
Sep 9 at 8:52












(To the OP) Note that it is best to avoid use of MathJax in titles as that prevents the questions from appearing in the Hot Network and reduces their searchability on platforms like Google. See my edit.
– Devashish Kaushik
Sep 9 at 9:16





(To the OP) Note that it is best to avoid use of MathJax in titles as that prevents the questions from appearing in the Hot Network and reduces their searchability on platforms like Google. See my edit.
– Devashish Kaushik
Sep 9 at 9:16











1 Answer
1






active

oldest

votes

















up vote
4
down vote



accepted










The flaw in your proof was pointed out in the comments, so let me show you my approach




Assume $sqrt 3$ has all digits $b_i=0$ for $iinn,...,2n$ (these are $n+1$ digits). Write



$$sqrt 3cdot 2^n-1=N + epsilon= b_1cdots b_n-1.underbrace0cdots0_n+1b_2n+1cdots$$



where $N=b_1cdots b_n-1inBbb N$ is the integer part, and $epsilon=0.b_nb_n+1cdotsin(0,1)$ is the fractional part (which is stricly positive because of the irrationality of $sqrt3$). We have $N< 1.8cdot 2^n-1$ (with $1.8$ being a rough upper bound for $sqrt 3$). Further, $epsilon$ must have zeros as the first $n+1$ digits $b_n,...,b_2n$. So the largest possible value is



$$epsilon le 0.underbrace0dots0_n+1overline 1=0.underbrace0cdots 0_n1=frac12^n+1$$



Now observe that



$$underbrace3cdot 2^2n-2_textinteger=(sqrt 3cdot2^n-1)^2=N^2+2Nepsilon+epsilon^2.$$



The left side is an integer, and so is $N^2$. Note that $0<2Nepsilon< 0.9$. And finally, since $epsilon^2<1/2^2n+2<0.1$, we cannot close the gap to make the right side a whole integer too.






share|cite|improve this answer






















  • For completeness, you should also show (or at least mention) that $epsilon$ can't be zero.
    – TonyK
    Sep 9 at 9:23










  • @TonyK Thanks, I included it!
    – M. Winter
    Sep 9 at 9:26










  • Nice solution! Thank you very much @M.Winter
    – abc...
    Sep 9 at 9:37










Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2910547%2fconsecutive-zeros-in-the-binary-representation-of-sqrt3%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
4
down vote



accepted










The flaw in your proof was pointed out in the comments, so let me show you my approach




Assume $sqrt 3$ has all digits $b_i=0$ for $iinn,...,2n$ (these are $n+1$ digits). Write



$$sqrt 3cdot 2^n-1=N + epsilon= b_1cdots b_n-1.underbrace0cdots0_n+1b_2n+1cdots$$



where $N=b_1cdots b_n-1inBbb N$ is the integer part, and $epsilon=0.b_nb_n+1cdotsin(0,1)$ is the fractional part (which is stricly positive because of the irrationality of $sqrt3$). We have $N< 1.8cdot 2^n-1$ (with $1.8$ being a rough upper bound for $sqrt 3$). Further, $epsilon$ must have zeros as the first $n+1$ digits $b_n,...,b_2n$. So the largest possible value is



$$epsilon le 0.underbrace0dots0_n+1overline 1=0.underbrace0cdots 0_n1=frac12^n+1$$



Now observe that



$$underbrace3cdot 2^2n-2_textinteger=(sqrt 3cdot2^n-1)^2=N^2+2Nepsilon+epsilon^2.$$



The left side is an integer, and so is $N^2$. Note that $0<2Nepsilon< 0.9$. And finally, since $epsilon^2<1/2^2n+2<0.1$, we cannot close the gap to make the right side a whole integer too.






share|cite|improve this answer






















  • For completeness, you should also show (or at least mention) that $epsilon$ can't be zero.
    – TonyK
    Sep 9 at 9:23










  • @TonyK Thanks, I included it!
    – M. Winter
    Sep 9 at 9:26










  • Nice solution! Thank you very much @M.Winter
    – abc...
    Sep 9 at 9:37














up vote
4
down vote



accepted










The flaw in your proof was pointed out in the comments, so let me show you my approach




Assume $sqrt 3$ has all digits $b_i=0$ for $iinn,...,2n$ (these are $n+1$ digits). Write



$$sqrt 3cdot 2^n-1=N + epsilon= b_1cdots b_n-1.underbrace0cdots0_n+1b_2n+1cdots$$



where $N=b_1cdots b_n-1inBbb N$ is the integer part, and $epsilon=0.b_nb_n+1cdotsin(0,1)$ is the fractional part (which is stricly positive because of the irrationality of $sqrt3$). We have $N< 1.8cdot 2^n-1$ (with $1.8$ being a rough upper bound for $sqrt 3$). Further, $epsilon$ must have zeros as the first $n+1$ digits $b_n,...,b_2n$. So the largest possible value is



$$epsilon le 0.underbrace0dots0_n+1overline 1=0.underbrace0cdots 0_n1=frac12^n+1$$



Now observe that



$$underbrace3cdot 2^2n-2_textinteger=(sqrt 3cdot2^n-1)^2=N^2+2Nepsilon+epsilon^2.$$



The left side is an integer, and so is $N^2$. Note that $0<2Nepsilon< 0.9$. And finally, since $epsilon^2<1/2^2n+2<0.1$, we cannot close the gap to make the right side a whole integer too.






share|cite|improve this answer






















  • For completeness, you should also show (or at least mention) that $epsilon$ can't be zero.
    – TonyK
    Sep 9 at 9:23










  • @TonyK Thanks, I included it!
    – M. Winter
    Sep 9 at 9:26










  • Nice solution! Thank you very much @M.Winter
    – abc...
    Sep 9 at 9:37












up vote
4
down vote



accepted







up vote
4
down vote



accepted






The flaw in your proof was pointed out in the comments, so let me show you my approach




Assume $sqrt 3$ has all digits $b_i=0$ for $iinn,...,2n$ (these are $n+1$ digits). Write



$$sqrt 3cdot 2^n-1=N + epsilon= b_1cdots b_n-1.underbrace0cdots0_n+1b_2n+1cdots$$



where $N=b_1cdots b_n-1inBbb N$ is the integer part, and $epsilon=0.b_nb_n+1cdotsin(0,1)$ is the fractional part (which is stricly positive because of the irrationality of $sqrt3$). We have $N< 1.8cdot 2^n-1$ (with $1.8$ being a rough upper bound for $sqrt 3$). Further, $epsilon$ must have zeros as the first $n+1$ digits $b_n,...,b_2n$. So the largest possible value is



$$epsilon le 0.underbrace0dots0_n+1overline 1=0.underbrace0cdots 0_n1=frac12^n+1$$



Now observe that



$$underbrace3cdot 2^2n-2_textinteger=(sqrt 3cdot2^n-1)^2=N^2+2Nepsilon+epsilon^2.$$



The left side is an integer, and so is $N^2$. Note that $0<2Nepsilon< 0.9$. And finally, since $epsilon^2<1/2^2n+2<0.1$, we cannot close the gap to make the right side a whole integer too.






share|cite|improve this answer














The flaw in your proof was pointed out in the comments, so let me show you my approach




Assume $sqrt 3$ has all digits $b_i=0$ for $iinn,...,2n$ (these are $n+1$ digits). Write



$$sqrt 3cdot 2^n-1=N + epsilon= b_1cdots b_n-1.underbrace0cdots0_n+1b_2n+1cdots$$



where $N=b_1cdots b_n-1inBbb N$ is the integer part, and $epsilon=0.b_nb_n+1cdotsin(0,1)$ is the fractional part (which is stricly positive because of the irrationality of $sqrt3$). We have $N< 1.8cdot 2^n-1$ (with $1.8$ being a rough upper bound for $sqrt 3$). Further, $epsilon$ must have zeros as the first $n+1$ digits $b_n,...,b_2n$. So the largest possible value is



$$epsilon le 0.underbrace0dots0_n+1overline 1=0.underbrace0cdots 0_n1=frac12^n+1$$



Now observe that



$$underbrace3cdot 2^2n-2_textinteger=(sqrt 3cdot2^n-1)^2=N^2+2Nepsilon+epsilon^2.$$



The left side is an integer, and so is $N^2$. Note that $0<2Nepsilon< 0.9$. And finally, since $epsilon^2<1/2^2n+2<0.1$, we cannot close the gap to make the right side a whole integer too.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Sep 9 at 9:36

























answered Sep 9 at 9:12









M. Winter

18.2k62764




18.2k62764











  • For completeness, you should also show (or at least mention) that $epsilon$ can't be zero.
    – TonyK
    Sep 9 at 9:23










  • @TonyK Thanks, I included it!
    – M. Winter
    Sep 9 at 9:26










  • Nice solution! Thank you very much @M.Winter
    – abc...
    Sep 9 at 9:37
















  • For completeness, you should also show (or at least mention) that $epsilon$ can't be zero.
    – TonyK
    Sep 9 at 9:23










  • @TonyK Thanks, I included it!
    – M. Winter
    Sep 9 at 9:26










  • Nice solution! Thank you very much @M.Winter
    – abc...
    Sep 9 at 9:37















For completeness, you should also show (or at least mention) that $epsilon$ can't be zero.
– TonyK
Sep 9 at 9:23




For completeness, you should also show (or at least mention) that $epsilon$ can't be zero.
– TonyK
Sep 9 at 9:23












@TonyK Thanks, I included it!
– M. Winter
Sep 9 at 9:26




@TonyK Thanks, I included it!
– M. Winter
Sep 9 at 9:26












Nice solution! Thank you very much @M.Winter
– abc...
Sep 9 at 9:37




Nice solution! Thank you very much @M.Winter
– abc...
Sep 9 at 9:37

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2910547%2fconsecutive-zeros-in-the-binary-representation-of-sqrt3%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

How to combine Bézier curves to a surface?

Carbon dioxide

Why am i infinitely getting the same tweet with the Twitter Search API?