bounding to get Number of digits without logsFind the number of digits in $2^2^22$ without logarithms.Difference between sum of even positioned digits and sum of odd positioned digits in a number is equal to 1prove that there are no number such that $overlineabldots=a^2+b^2+ldots$Is there an algebraic number which has all possible combinations of numbers?Last digits of a power of 2arbitrarily long sequences without perfect powersDistribution of digits in powers of 2Properties of The Number 137Can we generate arbitary long prime-number sequences by appending digits to a start prime?Repeatedly multiplying a number by itself - what explains the period of final digits?Sum of digits of sum of digits of sum of digits of $7^7^7^7$

Multi tool use
Multi tool use

Microchip documentation does not label CAN buss pins on micro controller pinout diagram

Multiplicative persistence

Will number of steps recorded on FitBit/any fitness tracker add up distance in PokemonGo?

Does the Linux kernel need a file system to run?

Non-trope happy ending?

Why is so much work done on numerical verification of the Riemann Hypothesis?

Has the laser at Magurele, Romania reached a tenth of the Sun's power?

Is there a nicer/politer/more positive alternative for "negates"?

Creating two special characters

awk assign to multiple variables at once

Short story about a deaf man, who cuts people tongues

Is there a RAID 0 Equivalent for RAM?

Why can't the Brexit deadlock in the UK parliament be solved with a plurality vote?

What to do when eye contact makes your coworker uncomfortable?

Why does AES have exactly 10 rounds for a 128-bit key, 12 for 192 bits and 14 for a 256-bit key size?

Is it allowed to activate the ability of multiple planeswalkers in a single turn?

C++ check if statement can be evaluated constexpr

Are Captain Marvel's powers affected by Thanos breaking the Tesseract and claiming the stone?

Stack Interview Code methods made from class Node and Smart Pointers

Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?

Pre-mixing cryogenic fuels and using only one fuel tank

Can a stoichiometric mixture of oxygen and methane exist as a liquid at standard pressure and some (low) temperature?

Quoting Keynes in a lecture

Does the reader need to like the PoV character?



bounding to get Number of digits without logs


Find the number of digits in $2^2^22$ without logarithms.Difference between sum of even positioned digits and sum of odd positioned digits in a number is equal to 1prove that there are no number such that $overlineabldots=a^2+b^2+ldots$Is there an algebraic number which has all possible combinations of numbers?Last digits of a power of 2arbitrarily long sequences without perfect powersDistribution of digits in powers of 2Properties of The Number 137Can we generate arbitary long prime-number sequences by appending digits to a start prime?Repeatedly multiplying a number by itself - what explains the period of final digits?Sum of digits of sum of digits of sum of digits of $7^7^7^7$













1












$begingroup$


I would like to prove that $10^168 le 2^561< 10^169$ (to get the number of digits of the power of two, if possible without the use of logarithms.



The idea came to me from this post



Using the fact that $5^3<2^7$ gives $10^168<2^560$.



Any advice to improve this bound and get the other are welcome.



Thanks










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Using log it is between $10^168$ and $10^169$ though.
    $endgroup$
    – Hw Chu
    Mar 14 at 17:36










  • $begingroup$
    using wolfram $floorlog(2^561) +1= 169$
    $endgroup$
    – ahmed
    Mar 14 at 17:37







  • 2




    $begingroup$
    Which means that $10^169$ is the upper bound.
    $endgroup$
    – Hw Chu
    Mar 14 at 17:39










  • $begingroup$
    fixed thanks, the RHS inequality is apparently the trickier
    $endgroup$
    – ahmed
    Mar 14 at 17:41















1












$begingroup$


I would like to prove that $10^168 le 2^561< 10^169$ (to get the number of digits of the power of two, if possible without the use of logarithms.



The idea came to me from this post



Using the fact that $5^3<2^7$ gives $10^168<2^560$.



Any advice to improve this bound and get the other are welcome.



Thanks










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Using log it is between $10^168$ and $10^169$ though.
    $endgroup$
    – Hw Chu
    Mar 14 at 17:36










  • $begingroup$
    using wolfram $floorlog(2^561) +1= 169$
    $endgroup$
    – ahmed
    Mar 14 at 17:37







  • 2




    $begingroup$
    Which means that $10^169$ is the upper bound.
    $endgroup$
    – Hw Chu
    Mar 14 at 17:39










  • $begingroup$
    fixed thanks, the RHS inequality is apparently the trickier
    $endgroup$
    – ahmed
    Mar 14 at 17:41













1












1








1





$begingroup$


I would like to prove that $10^168 le 2^561< 10^169$ (to get the number of digits of the power of two, if possible without the use of logarithms.



The idea came to me from this post



Using the fact that $5^3<2^7$ gives $10^168<2^560$.



Any advice to improve this bound and get the other are welcome.



Thanks










share|cite|improve this question











$endgroup$




I would like to prove that $10^168 le 2^561< 10^169$ (to get the number of digits of the power of two, if possible without the use of logarithms.



The idea came to me from this post



Using the fact that $5^3<2^7$ gives $10^168<2^560$.



Any advice to improve this bound and get the other are welcome.



Thanks







number-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 14 at 17:40







ahmed

















asked Mar 14 at 17:25









ahmedahmed

324




324







  • 1




    $begingroup$
    Using log it is between $10^168$ and $10^169$ though.
    $endgroup$
    – Hw Chu
    Mar 14 at 17:36










  • $begingroup$
    using wolfram $floorlog(2^561) +1= 169$
    $endgroup$
    – ahmed
    Mar 14 at 17:37







  • 2




    $begingroup$
    Which means that $10^169$ is the upper bound.
    $endgroup$
    – Hw Chu
    Mar 14 at 17:39










  • $begingroup$
    fixed thanks, the RHS inequality is apparently the trickier
    $endgroup$
    – ahmed
    Mar 14 at 17:41












  • 1




    $begingroup$
    Using log it is between $10^168$ and $10^169$ though.
    $endgroup$
    – Hw Chu
    Mar 14 at 17:36










  • $begingroup$
    using wolfram $floorlog(2^561) +1= 169$
    $endgroup$
    – ahmed
    Mar 14 at 17:37







  • 2




    $begingroup$
    Which means that $10^169$ is the upper bound.
    $endgroup$
    – Hw Chu
    Mar 14 at 17:39










  • $begingroup$
    fixed thanks, the RHS inequality is apparently the trickier
    $endgroup$
    – ahmed
    Mar 14 at 17:41







1




1




$begingroup$
Using log it is between $10^168$ and $10^169$ though.
$endgroup$
– Hw Chu
Mar 14 at 17:36




$begingroup$
Using log it is between $10^168$ and $10^169$ though.
$endgroup$
– Hw Chu
Mar 14 at 17:36












$begingroup$
using wolfram $floorlog(2^561) +1= 169$
$endgroup$
– ahmed
Mar 14 at 17:37





$begingroup$
using wolfram $floorlog(2^561) +1= 169$
$endgroup$
– ahmed
Mar 14 at 17:37





2




2




$begingroup$
Which means that $10^169$ is the upper bound.
$endgroup$
– Hw Chu
Mar 14 at 17:39




$begingroup$
Which means that $10^169$ is the upper bound.
$endgroup$
– Hw Chu
Mar 14 at 17:39












$begingroup$
fixed thanks, the RHS inequality is apparently the trickier
$endgroup$
– ahmed
Mar 14 at 17:41




$begingroup$
fixed thanks, the RHS inequality is apparently the trickier
$endgroup$
– ahmed
Mar 14 at 17:41










1 Answer
1






active

oldest

votes


















3












$begingroup$

Using the inequality $(1+frac1x)^nx < e^n$ when $x > 0$, you get



$$
beginaligned
2^561 &= 2cdot (2^10)^56 = 2cdot10^168cdot (1+0.024)^56\
&< 2cdot 10^168 cdot e^1.344\
&< 2cdot 10^168 cdot 2.89^1.5 = 2cdot 10^168cdot 1.7^3\
&= 2cdot 4.913 cdot 10^168 < 10^169.
endaligned
$$






share|cite|improve this answer









$endgroup$












    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',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    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%2f3148278%2fbounding-to-get-number-of-digits-without-logs%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    3












    $begingroup$

    Using the inequality $(1+frac1x)^nx < e^n$ when $x > 0$, you get



    $$
    beginaligned
    2^561 &= 2cdot (2^10)^56 = 2cdot10^168cdot (1+0.024)^56\
    &< 2cdot 10^168 cdot e^1.344\
    &< 2cdot 10^168 cdot 2.89^1.5 = 2cdot 10^168cdot 1.7^3\
    &= 2cdot 4.913 cdot 10^168 < 10^169.
    endaligned
    $$






    share|cite|improve this answer









    $endgroup$

















      3












      $begingroup$

      Using the inequality $(1+frac1x)^nx < e^n$ when $x > 0$, you get



      $$
      beginaligned
      2^561 &= 2cdot (2^10)^56 = 2cdot10^168cdot (1+0.024)^56\
      &< 2cdot 10^168 cdot e^1.344\
      &< 2cdot 10^168 cdot 2.89^1.5 = 2cdot 10^168cdot 1.7^3\
      &= 2cdot 4.913 cdot 10^168 < 10^169.
      endaligned
      $$






      share|cite|improve this answer









      $endgroup$















        3












        3








        3





        $begingroup$

        Using the inequality $(1+frac1x)^nx < e^n$ when $x > 0$, you get



        $$
        beginaligned
        2^561 &= 2cdot (2^10)^56 = 2cdot10^168cdot (1+0.024)^56\
        &< 2cdot 10^168 cdot e^1.344\
        &< 2cdot 10^168 cdot 2.89^1.5 = 2cdot 10^168cdot 1.7^3\
        &= 2cdot 4.913 cdot 10^168 < 10^169.
        endaligned
        $$






        share|cite|improve this answer









        $endgroup$



        Using the inequality $(1+frac1x)^nx < e^n$ when $x > 0$, you get



        $$
        beginaligned
        2^561 &= 2cdot (2^10)^56 = 2cdot10^168cdot (1+0.024)^56\
        &< 2cdot 10^168 cdot e^1.344\
        &< 2cdot 10^168 cdot 2.89^1.5 = 2cdot 10^168cdot 1.7^3\
        &= 2cdot 4.913 cdot 10^168 < 10^169.
        endaligned
        $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Mar 14 at 17:49









        Hw ChuHw Chu

        3,302519




        3,302519



























            draft saved

            draft discarded
















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid


            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.

            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3148278%2fbounding-to-get-number-of-digits-without-logs%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            HK qNgElcH78tAca0FDcSzhim5yWFOXUn PhMt,Vt7uu4YpQBC MCL lc78,vNEkO2ySKTlgB SjqWe4I4GyNGkp4qcyi,Zbg
            TcHIu,3,PaGRjsUJGwwxHlvjCEcccDOh qEqKVeSYXTri5i1TPQ,iI8T95ftrz 0My,L Hnrp

            Popular posts from this blog

            Football at the 1986 Brunei Merdeka Games Contents Teams Group stage Knockout stage References Navigation menu"Brunei Merdeka Games 1986".

            Solar Wings Breeze Design and development Specifications (Breeze) References Navigation menu1368-485X"Hang glider: Breeze (Solar Wings)"e

            Kathakali Contents Etymology and nomenclature History Repertoire Songs and musical instruments Traditional plays Styles: Sampradayam Training centers and awards Relationship to other dance forms See also Notes References External links Navigation menueThe Illustrated Encyclopedia of Hinduism: A-MSouth Asian Folklore: An EncyclopediaRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to Play10.1353/atj.2005.0004The Illustrated Encyclopedia of Hinduism: A-MEncyclopedia of HinduismKathakali Dance-drama: Where Gods and Demons Come to PlaySonic Liturgy: Ritual and Music in Hindu Tradition"The Mirror of Gesture"Kathakali Dance-drama: Where Gods and Demons Come to Play"Kathakali"Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceMedieval Indian Literature: An AnthologyThe Oxford Companion to Indian TheatreSouth Asian Folklore: An Encyclopedia : Afghanistan, Bangladesh, India, Nepal, Pakistan, Sri LankaThe Rise of Performance Studies: Rethinking Richard Schechner's Broad SpectrumIndian Theatre: Traditions of PerformanceModern Asian Theatre and Performance 1900-2000Critical Theory and PerformanceBetween Theater and AnthropologyKathakali603847011Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceBetween Theater and AnthropologyBetween Theater and AnthropologyNambeesan Smaraka AwardsArchivedThe Cambridge Guide to TheatreRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeThe Garland Encyclopedia of World Music: South Asia : the Indian subcontinentThe Ethos of Noh: Actors and Their Art10.2307/1145740By Means of Performance: Intercultural Studies of Theatre and Ritual10.1017/s204912550000100xReconceiving the Renaissance: A Critical ReaderPerformance TheoryListening to Theatre: The Aural Dimension of Beijing Opera10.2307/1146013Kathakali: The Art of the Non-WorldlyOn KathakaliKathakali, the dance theatreThe Kathakali Complex: Performance & StructureKathakali Dance-Drama: Where Gods and Demons Come to Play10.1093/obo/9780195399318-0071Drama and Ritual of Early Hinduism"In the Shadow of Hollywood Orientalism: Authentic East Indian Dancing"10.1080/08949460490274013Sanskrit Play Production in Ancient IndiaIndian Music: History and StructureBharata, the Nāṭyaśāstra233639306Table of Contents2238067286469807Dance In Indian Painting10.2307/32047833204783Kathakali Dance-Theatre: A Visual Narrative of Sacred Indian MimeIndian Classical Dance: The Renaissance and BeyondKathakali: an indigenous art-form of Keralaeee