How do I find sum of digits of a given factorial with missing digits?












0












$begingroup$


Suppose its given that




21!=5109094x17170y440000




How do I find




x+y




I know any factorial bigger than 6! will be divisible by 9. So I can apply that rule to find out it should be




52+x+y divisible by 9




. Which will imply that




x+y = 2




But looking at the answer




21! = 51090942171709440000




so




x+y = 11




Is there any rule that I am missing which will tell me the actual sum, not the digit sum?










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    Suppose its given that




    21!=5109094x17170y440000




    How do I find




    x+y




    I know any factorial bigger than 6! will be divisible by 9. So I can apply that rule to find out it should be




    52+x+y divisible by 9




    . Which will imply that




    x+y = 2




    But looking at the answer




    21! = 51090942171709440000




    so




    x+y = 11




    Is there any rule that I am missing which will tell me the actual sum, not the digit sum?










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      Suppose its given that




      21!=5109094x17170y440000




      How do I find




      x+y




      I know any factorial bigger than 6! will be divisible by 9. So I can apply that rule to find out it should be




      52+x+y divisible by 9




      . Which will imply that




      x+y = 2




      But looking at the answer




      21! = 51090942171709440000




      so




      x+y = 11




      Is there any rule that I am missing which will tell me the actual sum, not the digit sum?










      share|cite|improve this question









      $endgroup$




      Suppose its given that




      21!=5109094x17170y440000




      How do I find




      x+y




      I know any factorial bigger than 6! will be divisible by 9. So I can apply that rule to find out it should be




      52+x+y divisible by 9




      . Which will imply that




      x+y = 2




      But looking at the answer




      21! = 51090942171709440000




      so




      x+y = 11




      Is there any rule that I am missing which will tell me the actual sum, not the digit sum?







      number-theory factorial






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 31 at 0:31









      KhanKhan

      254




      254






















          2 Answers
          2






          active

          oldest

          votes


















          1












          $begingroup$

          You can use the divisibility test for $11$. Add the digits in even places and subtract the digits in odd places. The result must be a multiple of $11$. That will distinguish your two cases.






          share|cite|improve this answer









          $endgroup$





















            0












            $begingroup$

            One way to proceed is to note the excess factors of $2$ over factors of $5$. You may want to check out Legendre's Formula, which is relevant to what follows.



            Write down the numbers from $1$ to $21$. You see four of them with factors of $5$, each without a second factor of $5$. So the factorial has four factors of $5$. But for factors of $2$ first there are ten of those from $2$ up to $20$, then five of those ten are multiples of $4$ and thus have an additional factor of $2$, and you tack on still more factors of $2$ for the multiples of $8$ and finally $16$. You add all those up and there are $18$ factors of $2$.



            This difference between factors of $2$ and $5$ implies that there are only four terminal zeroes but the preceding digits must be a multiple of $2^{14}$. This means, for instance, the last six digits before the terminal zeroes must be a multiple of $64$. Why do I choose six digits in this example? As we will see, going three digits before the final $y$ will lead to a unique solution.



            Divide $170y44$ by $64$ by first putting in $y=0$, getting a remainder $R$, then interpreting the remainder as $100y+R$ for any $y$. Knowing $R$, you are to match $y$ with $R$ so that the combined remainder $100y+R$ is a multiple of $64$. Here $R=60$, and only $y=9$ among single positive digits matches with a multiple of $64$. Having found $x+y=11$ with the divisibility tests for $9$ and $11$ (Ross Milliken), you then conclude $x=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%2f3094326%2fhow-do-i-find-sum-of-digits-of-a-given-factorial-with-missing-digits%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$

              You can use the divisibility test for $11$. Add the digits in even places and subtract the digits in odd places. The result must be a multiple of $11$. That will distinguish your two cases.






              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$

                You can use the divisibility test for $11$. Add the digits in even places and subtract the digits in odd places. The result must be a multiple of $11$. That will distinguish your two cases.






                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  You can use the divisibility test for $11$. Add the digits in even places and subtract the digits in odd places. The result must be a multiple of $11$. That will distinguish your two cases.






                  share|cite|improve this answer









                  $endgroup$



                  You can use the divisibility test for $11$. Add the digits in even places and subtract the digits in odd places. The result must be a multiple of $11$. That will distinguish your two cases.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 31 at 0:34









                  Ross MillikanRoss Millikan

                  301k24200375




                  301k24200375























                      0












                      $begingroup$

                      One way to proceed is to note the excess factors of $2$ over factors of $5$. You may want to check out Legendre's Formula, which is relevant to what follows.



                      Write down the numbers from $1$ to $21$. You see four of them with factors of $5$, each without a second factor of $5$. So the factorial has four factors of $5$. But for factors of $2$ first there are ten of those from $2$ up to $20$, then five of those ten are multiples of $4$ and thus have an additional factor of $2$, and you tack on still more factors of $2$ for the multiples of $8$ and finally $16$. You add all those up and there are $18$ factors of $2$.



                      This difference between factors of $2$ and $5$ implies that there are only four terminal zeroes but the preceding digits must be a multiple of $2^{14}$. This means, for instance, the last six digits before the terminal zeroes must be a multiple of $64$. Why do I choose six digits in this example? As we will see, going three digits before the final $y$ will lead to a unique solution.



                      Divide $170y44$ by $64$ by first putting in $y=0$, getting a remainder $R$, then interpreting the remainder as $100y+R$ for any $y$. Knowing $R$, you are to match $y$ with $R$ so that the combined remainder $100y+R$ is a multiple of $64$. Here $R=60$, and only $y=9$ among single positive digits matches with a multiple of $64$. Having found $x+y=11$ with the divisibility tests for $9$ and $11$ (Ross Milliken), you then conclude $x=2$.






                      share|cite|improve this answer









                      $endgroup$


















                        0












                        $begingroup$

                        One way to proceed is to note the excess factors of $2$ over factors of $5$. You may want to check out Legendre's Formula, which is relevant to what follows.



                        Write down the numbers from $1$ to $21$. You see four of them with factors of $5$, each without a second factor of $5$. So the factorial has four factors of $5$. But for factors of $2$ first there are ten of those from $2$ up to $20$, then five of those ten are multiples of $4$ and thus have an additional factor of $2$, and you tack on still more factors of $2$ for the multiples of $8$ and finally $16$. You add all those up and there are $18$ factors of $2$.



                        This difference between factors of $2$ and $5$ implies that there are only four terminal zeroes but the preceding digits must be a multiple of $2^{14}$. This means, for instance, the last six digits before the terminal zeroes must be a multiple of $64$. Why do I choose six digits in this example? As we will see, going three digits before the final $y$ will lead to a unique solution.



                        Divide $170y44$ by $64$ by first putting in $y=0$, getting a remainder $R$, then interpreting the remainder as $100y+R$ for any $y$. Knowing $R$, you are to match $y$ with $R$ so that the combined remainder $100y+R$ is a multiple of $64$. Here $R=60$, and only $y=9$ among single positive digits matches with a multiple of $64$. Having found $x+y=11$ with the divisibility tests for $9$ and $11$ (Ross Milliken), you then conclude $x=2$.






                        share|cite|improve this answer









                        $endgroup$
















                          0












                          0








                          0





                          $begingroup$

                          One way to proceed is to note the excess factors of $2$ over factors of $5$. You may want to check out Legendre's Formula, which is relevant to what follows.



                          Write down the numbers from $1$ to $21$. You see four of them with factors of $5$, each without a second factor of $5$. So the factorial has four factors of $5$. But for factors of $2$ first there are ten of those from $2$ up to $20$, then five of those ten are multiples of $4$ and thus have an additional factor of $2$, and you tack on still more factors of $2$ for the multiples of $8$ and finally $16$. You add all those up and there are $18$ factors of $2$.



                          This difference between factors of $2$ and $5$ implies that there are only four terminal zeroes but the preceding digits must be a multiple of $2^{14}$. This means, for instance, the last six digits before the terminal zeroes must be a multiple of $64$. Why do I choose six digits in this example? As we will see, going three digits before the final $y$ will lead to a unique solution.



                          Divide $170y44$ by $64$ by first putting in $y=0$, getting a remainder $R$, then interpreting the remainder as $100y+R$ for any $y$. Knowing $R$, you are to match $y$ with $R$ so that the combined remainder $100y+R$ is a multiple of $64$. Here $R=60$, and only $y=9$ among single positive digits matches with a multiple of $64$. Having found $x+y=11$ with the divisibility tests for $9$ and $11$ (Ross Milliken), you then conclude $x=2$.






                          share|cite|improve this answer









                          $endgroup$



                          One way to proceed is to note the excess factors of $2$ over factors of $5$. You may want to check out Legendre's Formula, which is relevant to what follows.



                          Write down the numbers from $1$ to $21$. You see four of them with factors of $5$, each without a second factor of $5$. So the factorial has four factors of $5$. But for factors of $2$ first there are ten of those from $2$ up to $20$, then five of those ten are multiples of $4$ and thus have an additional factor of $2$, and you tack on still more factors of $2$ for the multiples of $8$ and finally $16$. You add all those up and there are $18$ factors of $2$.



                          This difference between factors of $2$ and $5$ implies that there are only four terminal zeroes but the preceding digits must be a multiple of $2^{14}$. This means, for instance, the last six digits before the terminal zeroes must be a multiple of $64$. Why do I choose six digits in this example? As we will see, going three digits before the final $y$ will lead to a unique solution.



                          Divide $170y44$ by $64$ by first putting in $y=0$, getting a remainder $R$, then interpreting the remainder as $100y+R$ for any $y$. Knowing $R$, you are to match $y$ with $R$ so that the combined remainder $100y+R$ is a multiple of $64$. Here $R=60$, and only $y=9$ among single positive digits matches with a multiple of $64$. Having found $x+y=11$ with the divisibility tests for $9$ and $11$ (Ross Milliken), you then conclude $x=2$.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Jan 31 at 1:00









                          Oscar LanziOscar Lanzi

                          13.5k12136




                          13.5k12136






























                              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%2f3094326%2fhow-do-i-find-sum-of-digits-of-a-given-factorial-with-missing-digits%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

                              MongoDB - Not Authorized To Execute Command

                              in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith

                              Npm cannot find a required file even through it is in the searched directory