How many 5-digit numbers satisfy this criterion?












1














How many $5$-digit numbers have the property that the sum of its digits equals the product of its digits?






permutations







share|cite|improve this question
























  • Examples seem to be rare. I found $11125$ and $11133$ though.
    – SmileyCraft
    1 hour ago












  • 11222 is one of it.
    – Heroic24
    1 hour ago










  • I am convinced these are all up to permutations. So there are $20+10+10=40$ examples in total.
    – SmileyCraft
    1 hour ago
















1














How many $5$-digit numbers have the property that the sum of its digits equals the product of its digits?






permutations







share|cite|improve this question
























  • Examples seem to be rare. I found $11125$ and $11133$ though.
    – SmileyCraft
    1 hour ago












  • 11222 is one of it.
    – Heroic24
    1 hour ago










  • I am convinced these are all up to permutations. So there are $20+10+10=40$ examples in total.
    – SmileyCraft
    1 hour ago














1












1








1







How many $5$-digit numbers have the property that the sum of its digits equals the product of its digits?






permutations







share|cite|improve this question















How many $5$-digit numbers have the property that the sum of its digits equals the product of its digits?






permutations




permutations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 57 mins ago









David G. Stork

9,93521232




9,93521232










asked 1 hour ago









Heroic24

1627




1627












  • Examples seem to be rare. I found $11125$ and $11133$ though.
    – SmileyCraft
    1 hour ago












  • 11222 is one of it.
    – Heroic24
    1 hour ago










  • I am convinced these are all up to permutations. So there are $20+10+10=40$ examples in total.
    – SmileyCraft
    1 hour ago


















  • Examples seem to be rare. I found $11125$ and $11133$ though.
    – SmileyCraft
    1 hour ago












  • 11222 is one of it.
    – Heroic24
    1 hour ago










  • I am convinced these are all up to permutations. So there are $20+10+10=40$ examples in total.
    – SmileyCraft
    1 hour ago
















Examples seem to be rare. I found $11125$ and $11133$ though.
– SmileyCraft
1 hour ago






Examples seem to be rare. I found $11125$ and $11133$ though.
– SmileyCraft
1 hour ago














11222 is one of it.
– Heroic24
1 hour ago




11222 is one of it.
– Heroic24
1 hour ago












I am convinced these are all up to permutations. So there are $20+10+10=40$ examples in total.
– SmileyCraft
1 hour ago




I am convinced these are all up to permutations. So there are $20+10+10=40$ examples in total.
– SmileyCraft
1 hour ago










2 Answers
2






active

oldest

votes


















4














We want to find natural number solutions to $$x_1+x_2+cdots +x_5 = x_1cdot x_2cdots x_5.$$
Assume that $$x_1leq x_2leq x_3leq x_4 leq x_5.$$
Since $x_1+cdots +x_5 = x_1cdots x_5 < 5x_5$ (as $x_1=x_2=cdots =x_5$ is impossible) we have that $x_1x_2x_3x_4 leq 4.$ This implies that $(x_1, x_2, x_3, x_4)$ is one of the sequences
$$(1, 1, 1, 1), (1, 1, 1, 2), (1, 1, 1, 3), (1, 1, 1, 4),(1, 1, 2, 2).$$
The sequences $(1, 1, 1, 1)$ and $(1, 1, 1, 4)$ are not good. There is no number
$x_5$ for such sequences. From the remaining sequences we obtain all the solutions
$$(1, 1, 1, 2, 5), (1, 1, 1, 3, 3) text{ and } (1, 1, 2, 2, 2).$$



This diophantine equation has an unsolved problem associated with it. If $a(n)$ is the number of solutions then $a(n)=1$ when $n=114,174text{ or }444$ where $n>100.$






share|cite|improve this answer























  • Oh, I should have mentioned that $n>100.$
    – Hello_World
    1 hour ago



















0














A simple Mathematica program finds the $40$ cases:



${11125, 11133, 11152, 11215, 11222, 11251, 11313, 11331, 11512,
11521, 12115, 12122, 12151, 12212, 12221, 12511, 13113, 13131, 13311,
15112, 15121, 15211, 21115, 21122, 21151, 21212, 21221, 21511, 22112,
22121, 22211, 25111, 31113, 31131, 31311, 33111, 51112, 51121, 51211,
52111}$




myList = Table[i, {i, 10000, 99999}];

Select[myList, 

 Times @@ RealDigits[#][[1]] == Total@RealDigits[#][[1]] &]





share|cite|improve this answer























    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%2f3063537%2fhow-many-5-digit-numbers-satisfy-this-criterion%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









    4














    We want to find natural number solutions to $$x_1+x_2+cdots +x_5 = x_1cdot x_2cdots x_5.$$
    Assume that $$x_1leq x_2leq x_3leq x_4 leq x_5.$$
    Since $x_1+cdots +x_5 = x_1cdots x_5 < 5x_5$ (as $x_1=x_2=cdots =x_5$ is impossible) we have that $x_1x_2x_3x_4 leq 4.$ This implies that $(x_1, x_2, x_3, x_4)$ is one of the sequences
    $$(1, 1, 1, 1), (1, 1, 1, 2), (1, 1, 1, 3), (1, 1, 1, 4),(1, 1, 2, 2).$$
    The sequences $(1, 1, 1, 1)$ and $(1, 1, 1, 4)$ are not good. There is no number
    $x_5$ for such sequences. From the remaining sequences we obtain all the solutions
    $$(1, 1, 1, 2, 5), (1, 1, 1, 3, 3) text{ and } (1, 1, 2, 2, 2).$$



    This diophantine equation has an unsolved problem associated with it. If $a(n)$ is the number of solutions then $a(n)=1$ when $n=114,174text{ or }444$ where $n>100.$






    share|cite|improve this answer























    • Oh, I should have mentioned that $n>100.$
      – Hello_World
      1 hour ago
















    4














    We want to find natural number solutions to $$x_1+x_2+cdots +x_5 = x_1cdot x_2cdots x_5.$$
    Assume that $$x_1leq x_2leq x_3leq x_4 leq x_5.$$
    Since $x_1+cdots +x_5 = x_1cdots x_5 < 5x_5$ (as $x_1=x_2=cdots =x_5$ is impossible) we have that $x_1x_2x_3x_4 leq 4.$ This implies that $(x_1, x_2, x_3, x_4)$ is one of the sequences
    $$(1, 1, 1, 1), (1, 1, 1, 2), (1, 1, 1, 3), (1, 1, 1, 4),(1, 1, 2, 2).$$
    The sequences $(1, 1, 1, 1)$ and $(1, 1, 1, 4)$ are not good. There is no number
    $x_5$ for such sequences. From the remaining sequences we obtain all the solutions
    $$(1, 1, 1, 2, 5), (1, 1, 1, 3, 3) text{ and } (1, 1, 2, 2, 2).$$



    This diophantine equation has an unsolved problem associated with it. If $a(n)$ is the number of solutions then $a(n)=1$ when $n=114,174text{ or }444$ where $n>100.$






    share|cite|improve this answer























    • Oh, I should have mentioned that $n>100.$
      – Hello_World
      1 hour ago














    4












    4








    4






    We want to find natural number solutions to $$x_1+x_2+cdots +x_5 = x_1cdot x_2cdots x_5.$$
    Assume that $$x_1leq x_2leq x_3leq x_4 leq x_5.$$
    Since $x_1+cdots +x_5 = x_1cdots x_5 < 5x_5$ (as $x_1=x_2=cdots =x_5$ is impossible) we have that $x_1x_2x_3x_4 leq 4.$ This implies that $(x_1, x_2, x_3, x_4)$ is one of the sequences
    $$(1, 1, 1, 1), (1, 1, 1, 2), (1, 1, 1, 3), (1, 1, 1, 4),(1, 1, 2, 2).$$
    The sequences $(1, 1, 1, 1)$ and $(1, 1, 1, 4)$ are not good. There is no number
    $x_5$ for such sequences. From the remaining sequences we obtain all the solutions
    $$(1, 1, 1, 2, 5), (1, 1, 1, 3, 3) text{ and } (1, 1, 2, 2, 2).$$



    This diophantine equation has an unsolved problem associated with it. If $a(n)$ is the number of solutions then $a(n)=1$ when $n=114,174text{ or }444$ where $n>100.$






    share|cite|improve this answer














    We want to find natural number solutions to $$x_1+x_2+cdots +x_5 = x_1cdot x_2cdots x_5.$$
    Assume that $$x_1leq x_2leq x_3leq x_4 leq x_5.$$
    Since $x_1+cdots +x_5 = x_1cdots x_5 < 5x_5$ (as $x_1=x_2=cdots =x_5$ is impossible) we have that $x_1x_2x_3x_4 leq 4.$ This implies that $(x_1, x_2, x_3, x_4)$ is one of the sequences
    $$(1, 1, 1, 1), (1, 1, 1, 2), (1, 1, 1, 3), (1, 1, 1, 4),(1, 1, 2, 2).$$
    The sequences $(1, 1, 1, 1)$ and $(1, 1, 1, 4)$ are not good. There is no number
    $x_5$ for such sequences. From the remaining sequences we obtain all the solutions
    $$(1, 1, 1, 2, 5), (1, 1, 1, 3, 3) text{ and } (1, 1, 2, 2, 2).$$



    This diophantine equation has an unsolved problem associated with it. If $a(n)$ is the number of solutions then $a(n)=1$ when $n=114,174text{ or }444$ where $n>100.$







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited 1 hour ago

























    answered 1 hour ago









    Hello_World

    4,02821630




    4,02821630












    • Oh, I should have mentioned that $n>100.$
      – Hello_World
      1 hour ago


















    • Oh, I should have mentioned that $n>100.$
      – Hello_World
      1 hour ago
















    Oh, I should have mentioned that $n>100.$
    – Hello_World
    1 hour ago




    Oh, I should have mentioned that $n>100.$
    – Hello_World
    1 hour ago











    0














    A simple Mathematica program finds the $40$ cases:



    ${11125, 11133, 11152, 11215, 11222, 11251, 11313, 11331, 11512,
    11521, 12115, 12122, 12151, 12212, 12221, 12511, 13113, 13131, 13311,
    15112, 15121, 15211, 21115, 21122, 21151, 21212, 21221, 21511, 22112,
    22121, 22211, 25111, 31113, 31131, 31311, 33111, 51112, 51121, 51211,
    52111}$




    myList = Table[i, {i, 10000, 99999}];
    
Select[myList, 
    
 Times @@ RealDigits[#][[1]] == Total@RealDigits[#][[1]] &]





    share|cite|improve this answer




























      0














      A simple Mathematica program finds the $40$ cases:



      ${11125, 11133, 11152, 11215, 11222, 11251, 11313, 11331, 11512,
      11521, 12115, 12122, 12151, 12212, 12221, 12511, 13113, 13131, 13311,
      15112, 15121, 15211, 21115, 21122, 21151, 21212, 21221, 21511, 22112,
      22121, 22211, 25111, 31113, 31131, 31311, 33111, 51112, 51121, 51211,
      52111}$




      myList = Table[i, {i, 10000, 99999}];
      
Select[myList, 
      
 Times @@ RealDigits[#][[1]] == Total@RealDigits[#][[1]] &]





      share|cite|improve this answer


























        0












        0








        0






        A simple Mathematica program finds the $40$ cases:



        ${11125, 11133, 11152, 11215, 11222, 11251, 11313, 11331, 11512,
        11521, 12115, 12122, 12151, 12212, 12221, 12511, 13113, 13131, 13311,
        15112, 15121, 15211, 21115, 21122, 21151, 21212, 21221, 21511, 22112,
        22121, 22211, 25111, 31113, 31131, 31311, 33111, 51112, 51121, 51211,
        52111}$




        myList = Table[i, {i, 10000, 99999}];
        
Select[myList, 
        
 Times @@ RealDigits[#][[1]] == Total@RealDigits[#][[1]] &]





        share|cite|improve this answer














        A simple Mathematica program finds the $40$ cases:



        ${11125, 11133, 11152, 11215, 11222, 11251, 11313, 11331, 11512,
        11521, 12115, 12122, 12151, 12212, 12221, 12511, 13113, 13131, 13311,
        15112, 15121, 15211, 21115, 21122, 21151, 21212, 21221, 21511, 22112,
        22121, 22211, 25111, 31113, 31131, 31311, 33111, 51112, 51121, 51211,
        52111}$




        myList = Table[i, {i, 10000, 99999}];
        
Select[myList, 
        
 Times @@ RealDigits[#][[1]] == Total@RealDigits[#][[1]] &]






        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 58 mins ago

























        answered 1 hour ago









        David G. Stork

        9,93521232




        9,93521232






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f3063537%2fhow-many-5-digit-numbers-satisfy-this-criterion%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

            CARDNET

            Image
            CARDNET は日本カードネットワークが運営するクレジット決済ネットワーク。日本カードネットワークの略称としてもCARDNETが使用されている。 事件・事故 2017年4月15日午前11時8分からクレジットカードの決済がしづらくなる障害が発生した。障害は同日午後5時18分に復旧した。原因は、複数あるCARDNETセンターの拠点のうち1つで、2重化してあるL3スイッチの片方が故障し、1系統にトラフィックが集中したことによる輻輳が発生したため。対処としては、故障したL3スイッチ交換とシステム再起動が行われた [1] 。 出典 ^ 金子寛人 ( 2017年4月17日 ). “CARDNETのクレジット決済に6時間強障害、原因はL3スイッチ故障”. 日経コンピュータ. 2018年10月18日 閲覧。 この項目は、コンピュータに関連した 書きかけの項目 です。この項目を加筆・訂正などしてくださる協力者を求めています（PJ:コンピュータ/P:コンピュータ）。 この項目は、経済に関連した 書きかけの項目 です。この項目を加筆・訂正などしてくださる協力者を求めています（ポータル 経済学、プロジェクト 経済）。 This page is only for reference, If you need detailed information, please check here
            Read more

            Boot-repair Failure: Unable to locate package grub-common:i386

            Image
            0 I am on a system dual-booting Windows and Debian (usually using the latter), and a recent Windows update appears to have wreaked havoc on the Debian boot system. I managed to boot Windows again, but not Linux. Following online suggestions, I created a Live USB of Ubuntu, and booted from that. Then I have installed and run the boot-repair utility. The utility instructs me to type several lines including sudo chroot "/mnt/boot-sav/sda6" apt-get purge -y grub*-common grub-common:i386 To which I receive the error E: Unable to locate package grub-common:i386 I am given to understand the issue may have to do with having UEFI vs BIOS (I believe I have UEFI), but do not understand this well. In any case I have subsequently run the boot-repair BootInfo Summary utility which created the following file h
            Read more

            Aws NAT - Aws IGW- Aws router

            Image
            4 As per this answer, router and gateway are same devices, in terms of functionality. In AWS world, we have internet gateway, NAT gateway and router Are these three not the same? amazon-web-services amazon-vpc gateway amazon-nat-gateway share edited 2 hours ago user1787812 asked 2 hours ago user1787812 user1787812 121 3 New contributor user1787812
            Read more