Number of divisors of $10!$












2












$begingroup$



Determine the amount of divisors of $10!$




This is a question in my combinatorics textbook, so I need to somehow reduce this to an elementary counting problem like combinations, permutations with or without repetition. I just don't see it. I can determine $10$ easy divisors, those are all the numbers $1$ through $10$ themselves. Then we can consider all possible products of these numbers, but then I get that a number can be either in the product , or not. I would get that it is $2^{10}=1024$ but the answer says it should be $270$.



What is going wrong here?



Note: $1$ and $10!$ are included






combinatorics divisibility factorial







share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    You just have to combine $$ d(n)=prod_{pmid n}left(nu_p(n)+1right) $$ with $$ nu_p(n!)=sum_{kgeq 1}leftlfloor frac{n}{p^k}rightrfloor$$ to get that the answer is $$ (5+2+1+1)(3+1+1)(2+1)(1+1)=270.$$
    $endgroup$
    – Jack D'Aurizio
    Dec 11 '18 at 0:53


















2












$begingroup$



Determine the amount of divisors of $10!$




This is a question in my combinatorics textbook, so I need to somehow reduce this to an elementary counting problem like combinations, permutations with or without repetition. I just don't see it. I can determine $10$ easy divisors, those are all the numbers $1$ through $10$ themselves. Then we can consider all possible products of these numbers, but then I get that a number can be either in the product , or not. I would get that it is $2^{10}=1024$ but the answer says it should be $270$.



What is going wrong here?



Note: $1$ and $10!$ are included






combinatorics divisibility factorial







share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    You just have to combine $$ d(n)=prod_{pmid n}left(nu_p(n)+1right) $$ with $$ nu_p(n!)=sum_{kgeq 1}leftlfloor frac{n}{p^k}rightrfloor$$ to get that the answer is $$ (5+2+1+1)(3+1+1)(2+1)(1+1)=270.$$
    $endgroup$
    – Jack D'Aurizio
    Dec 11 '18 at 0:53
















2












2








2





$begingroup$



Determine the amount of divisors of $10!$




This is a question in my combinatorics textbook, so I need to somehow reduce this to an elementary counting problem like combinations, permutations with or without repetition. I just don't see it. I can determine $10$ easy divisors, those are all the numbers $1$ through $10$ themselves. Then we can consider all possible products of these numbers, but then I get that a number can be either in the product , or not. I would get that it is $2^{10}=1024$ but the answer says it should be $270$.



What is going wrong here?



Note: $1$ and $10!$ are included






combinatorics divisibility factorial







share|cite|improve this question









$endgroup$





Determine the amount of divisors of $10!$




This is a question in my combinatorics textbook, so I need to somehow reduce this to an elementary counting problem like combinations, permutations with or without repetition. I just don't see it. I can determine $10$ easy divisors, those are all the numbers $1$ through $10$ themselves. Then we can consider all possible products of these numbers, but then I get that a number can be either in the product , or not. I would get that it is $2^{10}=1024$ but the answer says it should be $270$.



What is going wrong here?



Note: $1$ and $10!$ are included






combinatorics divisibility factorial




combinatorics divisibility factorial






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 11 '18 at 0:11









Wesley StrikWesley Strik

2,194424




2,194424








  • 2




    $begingroup$
    You just have to combine $$ d(n)=prod_{pmid n}left(nu_p(n)+1right) $$ with $$ nu_p(n!)=sum_{kgeq 1}leftlfloor frac{n}{p^k}rightrfloor$$ to get that the answer is $$ (5+2+1+1)(3+1+1)(2+1)(1+1)=270.$$
    $endgroup$
    – Jack D'Aurizio
    Dec 11 '18 at 0:53
















  • 2




    $begingroup$
    You just have to combine $$ d(n)=prod_{pmid n}left(nu_p(n)+1right) $$ with $$ nu_p(n!)=sum_{kgeq 1}leftlfloor frac{n}{p^k}rightrfloor$$ to get that the answer is $$ (5+2+1+1)(3+1+1)(2+1)(1+1)=270.$$
    $endgroup$
    – Jack D'Aurizio
    Dec 11 '18 at 0:53










2




2




$begingroup$
You just have to combine $$ d(n)=prod_{pmid n}left(nu_p(n)+1right) $$ with $$ nu_p(n!)=sum_{kgeq 1}leftlfloor frac{n}{p^k}rightrfloor$$ to get that the answer is $$ (5+2+1+1)(3+1+1)(2+1)(1+1)=270.$$
$endgroup$
– Jack D'Aurizio
Dec 11 '18 at 0:53






$begingroup$
You just have to combine $$ d(n)=prod_{pmid n}left(nu_p(n)+1right) $$ with $$ nu_p(n!)=sum_{kgeq 1}leftlfloor frac{n}{p^k}rightrfloor$$ to get that the answer is $$ (5+2+1+1)(3+1+1)(2+1)(1+1)=270.$$
$endgroup$
– Jack D'Aurizio
Dec 11 '18 at 0:53












3 Answers
3






active

oldest

votes


















7












$begingroup$

You've overcounted quite a bit, because integer factorization is not unique unless we're talking about primes. So for example, you've got $4 cdot 10 = 40 = 5 cdot 8$ counted twice.




So rather than thinking about numbers between $1$ and $10$, think of prime powers. A number is a divisor of $10!$ if and only if it is of the form



$$n = 2^a cdot 3^b cdot 5^c cdot 7^d$$
for appropriate ranges of $a, b, c, $ and $d$. I'll leave it to you to figure out why the values of $a, b, c, $ and $d$ range from $0$ to $8$, $4$, $2$ and $1$ respectively, giving



$$(8 + 1)(4 + 1)(2 + 1)(1 + 1) = 270$$



in total.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Easy, after your hint it all became clear, thank you! $10! = 1 cdot 2 cdot3 cdot 4 cdot 5 cdot 6 cdot 7 cdot 8cdot 9 cdot 10= 2 cdot 3 cdot 2^2 cdot 5 cdot 2 cdot 3 cdot 7 cdot 2^3 cdot 3^2 cdot 5 cdot 2= 2^8 cdot 3^4 cdot 5^2 cdot 7$
    $endgroup$
    – Wesley Strik
    Dec 11 '18 at 0:23








  • 1




    $begingroup$
    You're very welcome.
    $endgroup$
    – T. Bongers
    Dec 11 '18 at 0:24



















3












$begingroup$

Hint
$$10!=2^{??}cdot 3^{??}cdot5^{??}cdot 7^{??}$$



Now, any divisor must have the same primes with different powers...



The issue with your approach is that you are double and triple counting some divisors.



For example, you counted $8$ as $8$ but then you also counted it as $2 cdot 4$. Same way, most numbers divisible by $8$ are at least double counted.



You counted $24$ as the products $3 cdot 8, 4 cdot 6, 2 cdot 3 cdot 4$ and so on...






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Of course, unique prime factorisation.
    $endgroup$
    – Wesley Strik
    Dec 11 '18 at 0:20



















0












$begingroup$

Hint for a smaller number: consider $2^3cdot 3^2$ = 72. To make one of its factors, how many times do you want to use $2$?






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%2f3034686%2fnumber-of-divisors-of-10%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    7












    $begingroup$

    You've overcounted quite a bit, because integer factorization is not unique unless we're talking about primes. So for example, you've got $4 cdot 10 = 40 = 5 cdot 8$ counted twice.




    So rather than thinking about numbers between $1$ and $10$, think of prime powers. A number is a divisor of $10!$ if and only if it is of the form



    $$n = 2^a cdot 3^b cdot 5^c cdot 7^d$$
    for appropriate ranges of $a, b, c, $ and $d$. I'll leave it to you to figure out why the values of $a, b, c, $ and $d$ range from $0$ to $8$, $4$, $2$ and $1$ respectively, giving



    $$(8 + 1)(4 + 1)(2 + 1)(1 + 1) = 270$$



    in total.






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      Easy, after your hint it all became clear, thank you! $10! = 1 cdot 2 cdot3 cdot 4 cdot 5 cdot 6 cdot 7 cdot 8cdot 9 cdot 10= 2 cdot 3 cdot 2^2 cdot 5 cdot 2 cdot 3 cdot 7 cdot 2^3 cdot 3^2 cdot 5 cdot 2= 2^8 cdot 3^4 cdot 5^2 cdot 7$
      $endgroup$
      – Wesley Strik
      Dec 11 '18 at 0:23








    • 1




      $begingroup$
      You're very welcome.
      $endgroup$
      – T. Bongers
      Dec 11 '18 at 0:24
















    7












    $begingroup$

    You've overcounted quite a bit, because integer factorization is not unique unless we're talking about primes. So for example, you've got $4 cdot 10 = 40 = 5 cdot 8$ counted twice.




    So rather than thinking about numbers between $1$ and $10$, think of prime powers. A number is a divisor of $10!$ if and only if it is of the form



    $$n = 2^a cdot 3^b cdot 5^c cdot 7^d$$
    for appropriate ranges of $a, b, c, $ and $d$. I'll leave it to you to figure out why the values of $a, b, c, $ and $d$ range from $0$ to $8$, $4$, $2$ and $1$ respectively, giving



    $$(8 + 1)(4 + 1)(2 + 1)(1 + 1) = 270$$



    in total.






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      Easy, after your hint it all became clear, thank you! $10! = 1 cdot 2 cdot3 cdot 4 cdot 5 cdot 6 cdot 7 cdot 8cdot 9 cdot 10= 2 cdot 3 cdot 2^2 cdot 5 cdot 2 cdot 3 cdot 7 cdot 2^3 cdot 3^2 cdot 5 cdot 2= 2^8 cdot 3^4 cdot 5^2 cdot 7$
      $endgroup$
      – Wesley Strik
      Dec 11 '18 at 0:23








    • 1




      $begingroup$
      You're very welcome.
      $endgroup$
      – T. Bongers
      Dec 11 '18 at 0:24














    7












    7








    7





    $begingroup$

    You've overcounted quite a bit, because integer factorization is not unique unless we're talking about primes. So for example, you've got $4 cdot 10 = 40 = 5 cdot 8$ counted twice.




    So rather than thinking about numbers between $1$ and $10$, think of prime powers. A number is a divisor of $10!$ if and only if it is of the form



    $$n = 2^a cdot 3^b cdot 5^c cdot 7^d$$
    for appropriate ranges of $a, b, c, $ and $d$. I'll leave it to you to figure out why the values of $a, b, c, $ and $d$ range from $0$ to $8$, $4$, $2$ and $1$ respectively, giving



    $$(8 + 1)(4 + 1)(2 + 1)(1 + 1) = 270$$



    in total.






    share|cite|improve this answer









    $endgroup$



    You've overcounted quite a bit, because integer factorization is not unique unless we're talking about primes. So for example, you've got $4 cdot 10 = 40 = 5 cdot 8$ counted twice.




    So rather than thinking about numbers between $1$ and $10$, think of prime powers. A number is a divisor of $10!$ if and only if it is of the form



    $$n = 2^a cdot 3^b cdot 5^c cdot 7^d$$
    for appropriate ranges of $a, b, c, $ and $d$. I'll leave it to you to figure out why the values of $a, b, c, $ and $d$ range from $0$ to $8$, $4$, $2$ and $1$ respectively, giving



    $$(8 + 1)(4 + 1)(2 + 1)(1 + 1) = 270$$



    in total.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Dec 11 '18 at 0:15









    T. BongersT. Bongers

    23.5k54762




    23.5k54762












    • $begingroup$
      Easy, after your hint it all became clear, thank you! $10! = 1 cdot 2 cdot3 cdot 4 cdot 5 cdot 6 cdot 7 cdot 8cdot 9 cdot 10= 2 cdot 3 cdot 2^2 cdot 5 cdot 2 cdot 3 cdot 7 cdot 2^3 cdot 3^2 cdot 5 cdot 2= 2^8 cdot 3^4 cdot 5^2 cdot 7$
      $endgroup$
      – Wesley Strik
      Dec 11 '18 at 0:23








    • 1




      $begingroup$
      You're very welcome.
      $endgroup$
      – T. Bongers
      Dec 11 '18 at 0:24


















    • $begingroup$
      Easy, after your hint it all became clear, thank you! $10! = 1 cdot 2 cdot3 cdot 4 cdot 5 cdot 6 cdot 7 cdot 8cdot 9 cdot 10= 2 cdot 3 cdot 2^2 cdot 5 cdot 2 cdot 3 cdot 7 cdot 2^3 cdot 3^2 cdot 5 cdot 2= 2^8 cdot 3^4 cdot 5^2 cdot 7$
      $endgroup$
      – Wesley Strik
      Dec 11 '18 at 0:23








    • 1




      $begingroup$
      You're very welcome.
      $endgroup$
      – T. Bongers
      Dec 11 '18 at 0:24
















    $begingroup$
    Easy, after your hint it all became clear, thank you! $10! = 1 cdot 2 cdot3 cdot 4 cdot 5 cdot 6 cdot 7 cdot 8cdot 9 cdot 10= 2 cdot 3 cdot 2^2 cdot 5 cdot 2 cdot 3 cdot 7 cdot 2^3 cdot 3^2 cdot 5 cdot 2= 2^8 cdot 3^4 cdot 5^2 cdot 7$
    $endgroup$
    – Wesley Strik
    Dec 11 '18 at 0:23






    $begingroup$
    Easy, after your hint it all became clear, thank you! $10! = 1 cdot 2 cdot3 cdot 4 cdot 5 cdot 6 cdot 7 cdot 8cdot 9 cdot 10= 2 cdot 3 cdot 2^2 cdot 5 cdot 2 cdot 3 cdot 7 cdot 2^3 cdot 3^2 cdot 5 cdot 2= 2^8 cdot 3^4 cdot 5^2 cdot 7$
    $endgroup$
    – Wesley Strik
    Dec 11 '18 at 0:23






    1




    1




    $begingroup$
    You're very welcome.
    $endgroup$
    – T. Bongers
    Dec 11 '18 at 0:24




    $begingroup$
    You're very welcome.
    $endgroup$
    – T. Bongers
    Dec 11 '18 at 0:24











    3












    $begingroup$

    Hint
    $$10!=2^{??}cdot 3^{??}cdot5^{??}cdot 7^{??}$$



    Now, any divisor must have the same primes with different powers...



    The issue with your approach is that you are double and triple counting some divisors.



    For example, you counted $8$ as $8$ but then you also counted it as $2 cdot 4$. Same way, most numbers divisible by $8$ are at least double counted.



    You counted $24$ as the products $3 cdot 8, 4 cdot 6, 2 cdot 3 cdot 4$ and so on...






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Of course, unique prime factorisation.
      $endgroup$
      – Wesley Strik
      Dec 11 '18 at 0:20
















    3












    $begingroup$

    Hint
    $$10!=2^{??}cdot 3^{??}cdot5^{??}cdot 7^{??}$$



    Now, any divisor must have the same primes with different powers...



    The issue with your approach is that you are double and triple counting some divisors.



    For example, you counted $8$ as $8$ but then you also counted it as $2 cdot 4$. Same way, most numbers divisible by $8$ are at least double counted.



    You counted $24$ as the products $3 cdot 8, 4 cdot 6, 2 cdot 3 cdot 4$ and so on...






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Of course, unique prime factorisation.
      $endgroup$
      – Wesley Strik
      Dec 11 '18 at 0:20














    3












    3








    3





    $begingroup$

    Hint
    $$10!=2^{??}cdot 3^{??}cdot5^{??}cdot 7^{??}$$



    Now, any divisor must have the same primes with different powers...



    The issue with your approach is that you are double and triple counting some divisors.



    For example, you counted $8$ as $8$ but then you also counted it as $2 cdot 4$. Same way, most numbers divisible by $8$ are at least double counted.



    You counted $24$ as the products $3 cdot 8, 4 cdot 6, 2 cdot 3 cdot 4$ and so on...






    share|cite|improve this answer











    $endgroup$



    Hint
    $$10!=2^{??}cdot 3^{??}cdot5^{??}cdot 7^{??}$$



    Now, any divisor must have the same primes with different powers...



    The issue with your approach is that you are double and triple counting some divisors.



    For example, you counted $8$ as $8$ but then you also counted it as $2 cdot 4$. Same way, most numbers divisible by $8$ are at least double counted.



    You counted $24$ as the products $3 cdot 8, 4 cdot 6, 2 cdot 3 cdot 4$ and so on...







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Dec 11 '18 at 1:25









    AryanSonwatikar

    471114




    471114










    answered Dec 11 '18 at 0:18









    N. S.N. S.

    105k7114210




    105k7114210












    • $begingroup$
      Of course, unique prime factorisation.
      $endgroup$
      – Wesley Strik
      Dec 11 '18 at 0:20


















    • $begingroup$
      Of course, unique prime factorisation.
      $endgroup$
      – Wesley Strik
      Dec 11 '18 at 0:20
















    $begingroup$
    Of course, unique prime factorisation.
    $endgroup$
    – Wesley Strik
    Dec 11 '18 at 0:20




    $begingroup$
    Of course, unique prime factorisation.
    $endgroup$
    – Wesley Strik
    Dec 11 '18 at 0:20











    0












    $begingroup$

    Hint for a smaller number: consider $2^3cdot 3^2$ = 72. To make one of its factors, how many times do you want to use $2$?






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      Hint for a smaller number: consider $2^3cdot 3^2$ = 72. To make one of its factors, how many times do you want to use $2$?






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        Hint for a smaller number: consider $2^3cdot 3^2$ = 72. To make one of its factors, how many times do you want to use $2$?






        share|cite|improve this answer









        $endgroup$



        Hint for a smaller number: consider $2^3cdot 3^2$ = 72. To make one of its factors, how many times do you want to use $2$?







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 11 '18 at 1:18









        timtfjtimtfj

        2,483420




        2,483420






























            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%2f3034686%2fnumber-of-divisors-of-10%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

            Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

            Image
            2 2 I have a Zotero bibliography in Overleaf. I use biblatex . usepackage[backend=biber,citestyle=authoryear]{biblatex} addbibresource{zoteroALH.bib} Bibliography entries look like: @book{de_saint-gervais_uniformization_2016, title = {Uniformization of {Riemann} {Surfaces}}, isbn = {978-3-03719-145-3}, url = {https://www.ems-ph.org/books/book.php?proj_nr=198&srch=series%7Chem}, urldate = {2019-02-03}, author = {de Saint-Gervais, Paul Henri}, year = {2016}, doi = {10.4171/145} } In the bibliography down the paper the reference shows like this: There is the DOI, great, but also the URL which is unnecessary when the DOI is there. How can I remove the URL when the DOI is present? biblatex bibliographies overleaf zote
            Read more

            ComboBox Display Member on multiple fields

            Image
            2 I'm trying to set the .DisplayMember property of a ComboBox in C#, but I want to bind it to multiple columns in the .DataSouce . My SQL looks like this: SELECT PersNbr, PersFirstName, PersMiddleName, PersLastName FROM Pers WHERE PersNbr = :persNbr; I'm saving this query in a DataTable so each column selected has it's own column in the Datatable . I want to make the .DisplayMember a combination of PersFirstName + PersMiddleName + PersLastName so their full name appears like this: comboBox.DisplayMemeber = "PersFirstName" + "PersMiddleName" + "PersLastName" I know I can just to this on the query: SELECT PersNbr, (PersFirstName || PersMiddleName || PersLastName) PersName and then just do this: comboBox.DisplayMember = "PersName"; but I
            Read more

            Is it possible to collect Nectar points via Trainline?

            Image
            2 Since I am not eligible for any Railcard, the only available discount/bonus scheme is Nectar Card for me. GWR, SWR, LNER and Virgin Trains allow to collect Nectar points and I have already linked a card to my GWR account. A friend suggested me to use Trainline App, because it can search for bus tickets either. I had a look at the application, but could not see any option for Nectar. Is there a way to collect Nectar points when I buy tickets via Trainline? uk trains loyalty-programs trainline share | improve this question asked Dec 2 '18 at 15:50 ahmedus 3,224 5 19 49
            Read more