Check if $k$ is divisible by $2^9$ or $2^{10}$












1












$begingroup$


$k=frac{512!}{256!*128!*...*2!*1! } $



I need to check if the expression k is divisible by $2^9$ or $2^{10}$. This is a multiple choice question and the options and the question goes like this:



Statement I : $2^9 divides$ $k$



Statement II : $2^{10} divides$ $k$



(a) Statement I is true, Statement II is true



(b) Statement I is false, Statement II is true



(c) Statement I is true, Statement II is false



(d) Statement I is false, Statement II is false



I almost have no lead in this problem. I just figured out that the numbers are in power of 2 and $2^8!$ can get cancelled from numerator and denominator. :(






divisibility factorial







share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    You need Legendre's formula for the power of a prime dividing a factorial Clearly II implies I. From a test taking perspective, the fact that the question is asked means the answer is c. They would have chosen different exponents if not.
    $endgroup$
    – Ross Millikan
    Jan 9 at 4:23


















1












$begingroup$


$k=frac{512!}{256!*128!*...*2!*1! } $



I need to check if the expression k is divisible by $2^9$ or $2^{10}$. This is a multiple choice question and the options and the question goes like this:



Statement I : $2^9 divides$ $k$



Statement II : $2^{10} divides$ $k$



(a) Statement I is true, Statement II is true



(b) Statement I is false, Statement II is true



(c) Statement I is true, Statement II is false



(d) Statement I is false, Statement II is false



I almost have no lead in this problem. I just figured out that the numbers are in power of 2 and $2^8!$ can get cancelled from numerator and denominator. :(






divisibility factorial







share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    You need Legendre's formula for the power of a prime dividing a factorial Clearly II implies I. From a test taking perspective, the fact that the question is asked means the answer is c. They would have chosen different exponents if not.
    $endgroup$
    – Ross Millikan
    Jan 9 at 4:23
















1












1








1





$begingroup$


$k=frac{512!}{256!*128!*...*2!*1! } $



I need to check if the expression k is divisible by $2^9$ or $2^{10}$. This is a multiple choice question and the options and the question goes like this:



Statement I : $2^9 divides$ $k$



Statement II : $2^{10} divides$ $k$



(a) Statement I is true, Statement II is true



(b) Statement I is false, Statement II is true



(c) Statement I is true, Statement II is false



(d) Statement I is false, Statement II is false



I almost have no lead in this problem. I just figured out that the numbers are in power of 2 and $2^8!$ can get cancelled from numerator and denominator. :(






divisibility factorial







share|cite|improve this question









$endgroup$




$k=frac{512!}{256!*128!*...*2!*1! } $



I need to check if the expression k is divisible by $2^9$ or $2^{10}$. This is a multiple choice question and the options and the question goes like this:



Statement I : $2^9 divides$ $k$



Statement II : $2^{10} divides$ $k$



(a) Statement I is true, Statement II is true



(b) Statement I is false, Statement II is true



(c) Statement I is true, Statement II is false



(d) Statement I is false, Statement II is false



I almost have no lead in this problem. I just figured out that the numbers are in power of 2 and $2^8!$ can get cancelled from numerator and denominator. :(






divisibility factorial




divisibility factorial






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 9 at 4:12









tomriddle99tomriddle99

1157




1157








  • 2




    $begingroup$
    You need Legendre's formula for the power of a prime dividing a factorial Clearly II implies I. From a test taking perspective, the fact that the question is asked means the answer is c. They would have chosen different exponents if not.
    $endgroup$
    – Ross Millikan
    Jan 9 at 4:23
















  • 2




    $begingroup$
    You need Legendre's formula for the power of a prime dividing a factorial Clearly II implies I. From a test taking perspective, the fact that the question is asked means the answer is c. They would have chosen different exponents if not.
    $endgroup$
    – Ross Millikan
    Jan 9 at 4:23










2




2




$begingroup$
You need Legendre's formula for the power of a prime dividing a factorial Clearly II implies I. From a test taking perspective, the fact that the question is asked means the answer is c. They would have chosen different exponents if not.
$endgroup$
– Ross Millikan
Jan 9 at 4:23






$begingroup$
You need Legendre's formula for the power of a prime dividing a factorial Clearly II implies I. From a test taking perspective, the fact that the question is asked means the answer is c. They would have chosen different exponents if not.
$endgroup$
– Ross Millikan
Jan 9 at 4:23












2 Answers
2






active

oldest

votes


















1












$begingroup$

Well, to start with, any number that's divisible by $2^{10}$ is divisible by $2^n$ - so it's not (b).



To count how many times $2$ is a factor in $n!$, we ask a series of questions. That factorial is a product of $n$ terms; of those terms, how many are divisible by $2$? How many are divisible by $2^2$? How many are divisible by $2^3$? And so on, until we reach a power of $2$ that's larger than $n$. As an example, here's the power of $2$ that goes into $2019!$:

There are $1009$ even numbers $le 2019$, so that's $1009$ terms divisible by $2$. $504$ are divisible by $4$, $252$ are divisible by $8$, $126$ by $16$, $63$ by $32$, $31$ by $64$, $15$ by $128$, $7$ by $256$, $3$ by $512$, and finally one term is divisible by $1024$. Add those up: $1009+504+252+126+63+31+15+7+3+1=2011$. $2019!$ is divisible by $2^{2011}$ but not by $2^{2012}$.



Can you see how it will go for the factorials you're working with? They're all simpler than the example I gave. Once we have that, take the exponents we get for each term in the denominator and add them to get the exponent in the product. Subtract that from the exponent in the numerator to get the total here.



An additional note: the quantity $frac{512!}{256!cdot 128!cdot 64!cdots 2!cdot 1!}$ is an integer because it's a multinomial coefficient - or at least it is if we add another $1!$ term to that product in the denominator.



Oh, and a side note - there is a clever formula for the exponent of $2$ in a factorial. We don't need to know it to do this; it makes things a little easier, but we can just calculate them anyway.






share|cite|improve this answer











$endgroup$





















    1












    $begingroup$


    • $1! = 2^0$

    • $2! = 2^1$

    • $4! = 2^3 × 3$

    • $8! = 2^7 × 315$

    • $16! = 2^{15} × 638512875$


    Do you see the pattern here? Can you use it to find exactly how many powers of 2 are in the numerator and denominator?






    share|cite|improve this answer









    $endgroup$









    • 1




      $begingroup$
      If that pattern is maintained, the denominator has the total power of: $1+3+7+15+31+63+127+255 = 502$ and the numerator has a total power of: $255+256=511$ in the base of $2$. So, $k$ will be divisible by $2^9$ but not by $2^{10}$. Therefore, correct choice is: (c) .
      $endgroup$
      – tomriddle99
      Jan 9 at 4:54











    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%2f3067058%2fcheck-if-k-is-divisible-by-29-or-210%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    Well, to start with, any number that's divisible by $2^{10}$ is divisible by $2^n$ - so it's not (b).



    To count how many times $2$ is a factor in $n!$, we ask a series of questions. That factorial is a product of $n$ terms; of those terms, how many are divisible by $2$? How many are divisible by $2^2$? How many are divisible by $2^3$? And so on, until we reach a power of $2$ that's larger than $n$. As an example, here's the power of $2$ that goes into $2019!$:

    There are $1009$ even numbers $le 2019$, so that's $1009$ terms divisible by $2$. $504$ are divisible by $4$, $252$ are divisible by $8$, $126$ by $16$, $63$ by $32$, $31$ by $64$, $15$ by $128$, $7$ by $256$, $3$ by $512$, and finally one term is divisible by $1024$. Add those up: $1009+504+252+126+63+31+15+7+3+1=2011$. $2019!$ is divisible by $2^{2011}$ but not by $2^{2012}$.



    Can you see how it will go for the factorials you're working with? They're all simpler than the example I gave. Once we have that, take the exponents we get for each term in the denominator and add them to get the exponent in the product. Subtract that from the exponent in the numerator to get the total here.



    An additional note: the quantity $frac{512!}{256!cdot 128!cdot 64!cdots 2!cdot 1!}$ is an integer because it's a multinomial coefficient - or at least it is if we add another $1!$ term to that product in the denominator.



    Oh, and a side note - there is a clever formula for the exponent of $2$ in a factorial. We don't need to know it to do this; it makes things a little easier, but we can just calculate them anyway.






    share|cite|improve this answer











    $endgroup$


















      1












      $begingroup$

      Well, to start with, any number that's divisible by $2^{10}$ is divisible by $2^n$ - so it's not (b).



      To count how many times $2$ is a factor in $n!$, we ask a series of questions. That factorial is a product of $n$ terms; of those terms, how many are divisible by $2$? How many are divisible by $2^2$? How many are divisible by $2^3$? And so on, until we reach a power of $2$ that's larger than $n$. As an example, here's the power of $2$ that goes into $2019!$:

      There are $1009$ even numbers $le 2019$, so that's $1009$ terms divisible by $2$. $504$ are divisible by $4$, $252$ are divisible by $8$, $126$ by $16$, $63$ by $32$, $31$ by $64$, $15$ by $128$, $7$ by $256$, $3$ by $512$, and finally one term is divisible by $1024$. Add those up: $1009+504+252+126+63+31+15+7+3+1=2011$. $2019!$ is divisible by $2^{2011}$ but not by $2^{2012}$.



      Can you see how it will go for the factorials you're working with? They're all simpler than the example I gave. Once we have that, take the exponents we get for each term in the denominator and add them to get the exponent in the product. Subtract that from the exponent in the numerator to get the total here.



      An additional note: the quantity $frac{512!}{256!cdot 128!cdot 64!cdots 2!cdot 1!}$ is an integer because it's a multinomial coefficient - or at least it is if we add another $1!$ term to that product in the denominator.



      Oh, and a side note - there is a clever formula for the exponent of $2$ in a factorial. We don't need to know it to do this; it makes things a little easier, but we can just calculate them anyway.






      share|cite|improve this answer











      $endgroup$
















        1












        1








        1





        $begingroup$

        Well, to start with, any number that's divisible by $2^{10}$ is divisible by $2^n$ - so it's not (b).



        To count how many times $2$ is a factor in $n!$, we ask a series of questions. That factorial is a product of $n$ terms; of those terms, how many are divisible by $2$? How many are divisible by $2^2$? How many are divisible by $2^3$? And so on, until we reach a power of $2$ that's larger than $n$. As an example, here's the power of $2$ that goes into $2019!$:

        There are $1009$ even numbers $le 2019$, so that's $1009$ terms divisible by $2$. $504$ are divisible by $4$, $252$ are divisible by $8$, $126$ by $16$, $63$ by $32$, $31$ by $64$, $15$ by $128$, $7$ by $256$, $3$ by $512$, and finally one term is divisible by $1024$. Add those up: $1009+504+252+126+63+31+15+7+3+1=2011$. $2019!$ is divisible by $2^{2011}$ but not by $2^{2012}$.



        Can you see how it will go for the factorials you're working with? They're all simpler than the example I gave. Once we have that, take the exponents we get for each term in the denominator and add them to get the exponent in the product. Subtract that from the exponent in the numerator to get the total here.



        An additional note: the quantity $frac{512!}{256!cdot 128!cdot 64!cdots 2!cdot 1!}$ is an integer because it's a multinomial coefficient - or at least it is if we add another $1!$ term to that product in the denominator.



        Oh, and a side note - there is a clever formula for the exponent of $2$ in a factorial. We don't need to know it to do this; it makes things a little easier, but we can just calculate them anyway.






        share|cite|improve this answer











        $endgroup$



        Well, to start with, any number that's divisible by $2^{10}$ is divisible by $2^n$ - so it's not (b).



        To count how many times $2$ is a factor in $n!$, we ask a series of questions. That factorial is a product of $n$ terms; of those terms, how many are divisible by $2$? How many are divisible by $2^2$? How many are divisible by $2^3$? And so on, until we reach a power of $2$ that's larger than $n$. As an example, here's the power of $2$ that goes into $2019!$:

        There are $1009$ even numbers $le 2019$, so that's $1009$ terms divisible by $2$. $504$ are divisible by $4$, $252$ are divisible by $8$, $126$ by $16$, $63$ by $32$, $31$ by $64$, $15$ by $128$, $7$ by $256$, $3$ by $512$, and finally one term is divisible by $1024$. Add those up: $1009+504+252+126+63+31+15+7+3+1=2011$. $2019!$ is divisible by $2^{2011}$ but not by $2^{2012}$.



        Can you see how it will go for the factorials you're working with? They're all simpler than the example I gave. Once we have that, take the exponents we get for each term in the denominator and add them to get the exponent in the product. Subtract that from the exponent in the numerator to get the total here.



        An additional note: the quantity $frac{512!}{256!cdot 128!cdot 64!cdots 2!cdot 1!}$ is an integer because it's a multinomial coefficient - or at least it is if we add another $1!$ term to that product in the denominator.



        Oh, and a side note - there is a clever formula for the exponent of $2$ in a factorial. We don't need to know it to do this; it makes things a little easier, but we can just calculate them anyway.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 9 at 4:53

























        answered Jan 9 at 4:33









        jmerryjmerry

        3,875514




        3,875514























            1












            $begingroup$


            • $1! = 2^0$

            • $2! = 2^1$

            • $4! = 2^3 × 3$

            • $8! = 2^7 × 315$

            • $16! = 2^{15} × 638512875$


            Do you see the pattern here? Can you use it to find exactly how many powers of 2 are in the numerator and denominator?






            share|cite|improve this answer









            $endgroup$









            • 1




              $begingroup$
              If that pattern is maintained, the denominator has the total power of: $1+3+7+15+31+63+127+255 = 502$ and the numerator has a total power of: $255+256=511$ in the base of $2$. So, $k$ will be divisible by $2^9$ but not by $2^{10}$. Therefore, correct choice is: (c) .
              $endgroup$
              – tomriddle99
              Jan 9 at 4:54
















            1












            $begingroup$


            • $1! = 2^0$

            • $2! = 2^1$

            • $4! = 2^3 × 3$

            • $8! = 2^7 × 315$

            • $16! = 2^{15} × 638512875$


            Do you see the pattern here? Can you use it to find exactly how many powers of 2 are in the numerator and denominator?






            share|cite|improve this answer









            $endgroup$









            • 1




              $begingroup$
              If that pattern is maintained, the denominator has the total power of: $1+3+7+15+31+63+127+255 = 502$ and the numerator has a total power of: $255+256=511$ in the base of $2$. So, $k$ will be divisible by $2^9$ but not by $2^{10}$. Therefore, correct choice is: (c) .
              $endgroup$
              – tomriddle99
              Jan 9 at 4:54














            1












            1








            1





            $begingroup$


            • $1! = 2^0$

            • $2! = 2^1$

            • $4! = 2^3 × 3$

            • $8! = 2^7 × 315$

            • $16! = 2^{15} × 638512875$


            Do you see the pattern here? Can you use it to find exactly how many powers of 2 are in the numerator and denominator?






            share|cite|improve this answer









            $endgroup$




            • $1! = 2^0$

            • $2! = 2^1$

            • $4! = 2^3 × 3$

            • $8! = 2^7 × 315$

            • $16! = 2^{15} × 638512875$


            Do you see the pattern here? Can you use it to find exactly how many powers of 2 are in the numerator and denominator?







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 9 at 4:37









            DanDan

            4,50511517




            4,50511517








            • 1




              $begingroup$
              If that pattern is maintained, the denominator has the total power of: $1+3+7+15+31+63+127+255 = 502$ and the numerator has a total power of: $255+256=511$ in the base of $2$. So, $k$ will be divisible by $2^9$ but not by $2^{10}$. Therefore, correct choice is: (c) .
              $endgroup$
              – tomriddle99
              Jan 9 at 4:54














            • 1




              $begingroup$
              If that pattern is maintained, the denominator has the total power of: $1+3+7+15+31+63+127+255 = 502$ and the numerator has a total power of: $255+256=511$ in the base of $2$. So, $k$ will be divisible by $2^9$ but not by $2^{10}$. Therefore, correct choice is: (c) .
              $endgroup$
              – tomriddle99
              Jan 9 at 4:54








            1




            1




            $begingroup$
            If that pattern is maintained, the denominator has the total power of: $1+3+7+15+31+63+127+255 = 502$ and the numerator has a total power of: $255+256=511$ in the base of $2$. So, $k$ will be divisible by $2^9$ but not by $2^{10}$. Therefore, correct choice is: (c) .
            $endgroup$
            – tomriddle99
            Jan 9 at 4:54




            $begingroup$
            If that pattern is maintained, the denominator has the total power of: $1+3+7+15+31+63+127+255 = 502$ and the numerator has a total power of: $255+256=511$ in the base of $2$. So, $k$ will be divisible by $2^9$ but not by $2^{10}$. Therefore, correct choice is: (c) .
            $endgroup$
            – tomriddle99
            Jan 9 at 4:54


















            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%2f3067058%2fcheck-if-k-is-divisible-by-29-or-210%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







            -

            Popular posts from this blog

            Mario Kart Wii

            Image
            Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro
            Read more

            What does “Dominus providebit” mean?

            Image
            5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1
            Read more

            Antonio Litta Visconti Arese

            Image
            Antonio Litta Visconti Arese I duca Litta, VII marchese di Gambolò In carica 1797 – 1820 Predecessore Pompeo Litta Visconti Arese Successore Alfonso Litta Visconti Arese Trattamento Sua grazia Altri titoli Duca Litta Conte del Regno napoleonico d'Italia Patrizio milanese Don Nascita Milano, 2 maggio 1748 Morte Milano, 14 agosto 1820 Dinastia Litta Visconti Arese Padre Pompeo Litta Visconti Arese Madre Maria Elisabetta Visconti Borromeo Consorte Barbara Barbiano di Belgioioso Religione cattolicesimo Antonio Litta Visconti Arese , I duca Litta, VII marchese di Gambolò (Milano, 2 maggio 1748 – Milano, 14 agosto 1820), è stato un nobile e politico italiano. Composizione "Il pastore svizzero" di Pietro Morlacchi, con dedica Indice 1 Biografia 2 Onorificenze 3 Araldica 4 Albero genealogico 5 Note 6 Altri progetti Biografia | Antonio Litta Visco
            Read more