Can divisibility rules for digits be generalized to sum of digits












2












$begingroup$


Suppose that we are given a two digit number $AB$, where $A$ and $B$ represents the digits, i.e 21 would be A=2 , B=1. I wish to prove that the sum of $AB$ and $BA$ is always divisible by $11$.
My initial idée was to use the fact that if a number is divisible by $11$ then the sum of its digits with alternating sign is also divisible by 11. For example
$$1-2+3-3+2-1=0 $$
so $11$ divides $123321$. So my proof would then be to consider the two digit number $(A+B)(B+A)$ or $CC$ which clearly is divisible by $11$ by the above statement if $C$ is $1$ through $9$. However, I am having truble justifying the case were $A+B$ is greater than or equal to $10$ and it got me wondering if the more generel is true: Let $ABCD...$ be a $n-digit$ number, if $$A-B+C-... equiv 0 (mod 11)$$
then $$S=sum_{k=1}^{n}(A+B+C+...)10^{k} equiv0(mod 11)$$
I am not really familliar with the whole congruence thingy, so incase the above is trivial I would be greatful on some source which could aid the solving of the above . Any tips or suggestion are also very welcome










share|cite|improve this question











$endgroup$












  • $begingroup$
    math.stackexchange.com/questions/328562/…
    $endgroup$
    – lab bhattacharjee
    Apr 6 at 16:20










  • $begingroup$
    Use pmod{11} to produce $pmod{11}$. So aequiv bpmod{11} produces $aequiv bpmod{11}$.
    $endgroup$
    – Arturo Magidin
    Apr 6 at 16:20
















2












$begingroup$


Suppose that we are given a two digit number $AB$, where $A$ and $B$ represents the digits, i.e 21 would be A=2 , B=1. I wish to prove that the sum of $AB$ and $BA$ is always divisible by $11$.
My initial idée was to use the fact that if a number is divisible by $11$ then the sum of its digits with alternating sign is also divisible by 11. For example
$$1-2+3-3+2-1=0 $$
so $11$ divides $123321$. So my proof would then be to consider the two digit number $(A+B)(B+A)$ or $CC$ which clearly is divisible by $11$ by the above statement if $C$ is $1$ through $9$. However, I am having truble justifying the case were $A+B$ is greater than or equal to $10$ and it got me wondering if the more generel is true: Let $ABCD...$ be a $n-digit$ number, if $$A-B+C-... equiv 0 (mod 11)$$
then $$S=sum_{k=1}^{n}(A+B+C+...)10^{k} equiv0(mod 11)$$
I am not really familliar with the whole congruence thingy, so incase the above is trivial I would be greatful on some source which could aid the solving of the above . Any tips or suggestion are also very welcome










share|cite|improve this question











$endgroup$












  • $begingroup$
    math.stackexchange.com/questions/328562/…
    $endgroup$
    – lab bhattacharjee
    Apr 6 at 16:20










  • $begingroup$
    Use pmod{11} to produce $pmod{11}$. So aequiv bpmod{11} produces $aequiv bpmod{11}$.
    $endgroup$
    – Arturo Magidin
    Apr 6 at 16:20














2












2








2


1



$begingroup$


Suppose that we are given a two digit number $AB$, where $A$ and $B$ represents the digits, i.e 21 would be A=2 , B=1. I wish to prove that the sum of $AB$ and $BA$ is always divisible by $11$.
My initial idée was to use the fact that if a number is divisible by $11$ then the sum of its digits with alternating sign is also divisible by 11. For example
$$1-2+3-3+2-1=0 $$
so $11$ divides $123321$. So my proof would then be to consider the two digit number $(A+B)(B+A)$ or $CC$ which clearly is divisible by $11$ by the above statement if $C$ is $1$ through $9$. However, I am having truble justifying the case were $A+B$ is greater than or equal to $10$ and it got me wondering if the more generel is true: Let $ABCD...$ be a $n-digit$ number, if $$A-B+C-... equiv 0 (mod 11)$$
then $$S=sum_{k=1}^{n}(A+B+C+...)10^{k} equiv0(mod 11)$$
I am not really familliar with the whole congruence thingy, so incase the above is trivial I would be greatful on some source which could aid the solving of the above . Any tips or suggestion are also very welcome










share|cite|improve this question











$endgroup$




Suppose that we are given a two digit number $AB$, where $A$ and $B$ represents the digits, i.e 21 would be A=2 , B=1. I wish to prove that the sum of $AB$ and $BA$ is always divisible by $11$.
My initial idée was to use the fact that if a number is divisible by $11$ then the sum of its digits with alternating sign is also divisible by 11. For example
$$1-2+3-3+2-1=0 $$
so $11$ divides $123321$. So my proof would then be to consider the two digit number $(A+B)(B+A)$ or $CC$ which clearly is divisible by $11$ by the above statement if $C$ is $1$ through $9$. However, I am having truble justifying the case were $A+B$ is greater than or equal to $10$ and it got me wondering if the more generel is true: Let $ABCD...$ be a $n-digit$ number, if $$A-B+C-... equiv 0 (mod 11)$$
then $$S=sum_{k=1}^{n}(A+B+C+...)10^{k} equiv0(mod 11)$$
I am not really familliar with the whole congruence thingy, so incase the above is trivial I would be greatful on some source which could aid the solving of the above . Any tips or suggestion are also very welcome







divisibility






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Apr 6 at 16:19







André Armatowski

















asked Apr 6 at 16:14









André ArmatowskiAndré Armatowski

264




264












  • $begingroup$
    math.stackexchange.com/questions/328562/…
    $endgroup$
    – lab bhattacharjee
    Apr 6 at 16:20










  • $begingroup$
    Use pmod{11} to produce $pmod{11}$. So aequiv bpmod{11} produces $aequiv bpmod{11}$.
    $endgroup$
    – Arturo Magidin
    Apr 6 at 16:20


















  • $begingroup$
    math.stackexchange.com/questions/328562/…
    $endgroup$
    – lab bhattacharjee
    Apr 6 at 16:20










  • $begingroup$
    Use pmod{11} to produce $pmod{11}$. So aequiv bpmod{11} produces $aequiv bpmod{11}$.
    $endgroup$
    – Arturo Magidin
    Apr 6 at 16:20
















$begingroup$
math.stackexchange.com/questions/328562/…
$endgroup$
– lab bhattacharjee
Apr 6 at 16:20




$begingroup$
math.stackexchange.com/questions/328562/…
$endgroup$
– lab bhattacharjee
Apr 6 at 16:20












$begingroup$
Use pmod{11} to produce $pmod{11}$. So aequiv bpmod{11} produces $aequiv bpmod{11}$.
$endgroup$
– Arturo Magidin
Apr 6 at 16:20




$begingroup$
Use pmod{11} to produce $pmod{11}$. So aequiv bpmod{11} produces $aequiv bpmod{11}$.
$endgroup$
– Arturo Magidin
Apr 6 at 16:20










3 Answers
3






active

oldest

votes


















2












$begingroup$

More generally, recall that the radix $rm,b,$ digit string $rm d_n cdots d_1 d_0 $ denotes a polynomial expression $rm P(b) = d_n b^n +:cdots: + d_1 b + d_0,, $ where $rm P(x) = d_n x^n +cdots+ d_1 x + d_0., $ Recall the reversed (digits) polynomial is $rm {bf tilde {rm P}}(x) = x^n P(1/x).,$ If $rm:n:$ is odd the Polynomial Congruence Rule yields $$rm: mod b!+!1: color{#c00}{bequiv -1} Rightarrow {bf tilde {rm P}}(b) = color{#c00}b^n P(1/color{#c00}b) equiv (color{#c00}{-1})^n P(color{#c00}{-1})equiv {-}P(-1),:$$ therefore we conclude that $rm P(b) + {bf tilde {rm P}}(b)equiv P(-1)-P(-1)equiv 0.,$ OP is case $rm,b=10, n=1$.



Remark $ $ Essentially we have twice applied the radix $rm,b,$ analog of casting out elevens (the analog of casting out nines).






share|cite|improve this answer











$endgroup$





















    11












    $begingroup$

    It's simpler than you are making it...and no congruences are needed:



    We have $$overline {AB}=10A+B quad &quad overline {BA}=10B+A$$



    It follows that $$overline {AB}+overline {BA}=11times (A+B)$$ and we are done.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Very clean, totally escaped me!
      $endgroup$
      – André Armatowski
      Apr 6 at 16:20



















    2












    $begingroup$

    You can easily push through what you were trying though. Say your numbers are $AB$ and $BA$. If $A+Bgt 10$, then write it as $A+B=10+c$; note that $0leq cleq 8$, because two digits cannot add to $19$. That means that when you do the carry, the second digit is $(c+1)$, and so $AB+BA$ will be a three digit number: $1$, then $c+1$, and then $c$. At this point, your test gives you $1-(c+1)+c = 0$, so you get a multiple of $11$.






    share|cite|improve this answer









    $endgroup$














      Your Answer








      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%2f3177167%2fcan-divisibility-rules-for-digits-be-generalized-to-sum-of-digits%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









      2












      $begingroup$

      More generally, recall that the radix $rm,b,$ digit string $rm d_n cdots d_1 d_0 $ denotes a polynomial expression $rm P(b) = d_n b^n +:cdots: + d_1 b + d_0,, $ where $rm P(x) = d_n x^n +cdots+ d_1 x + d_0., $ Recall the reversed (digits) polynomial is $rm {bf tilde {rm P}}(x) = x^n P(1/x).,$ If $rm:n:$ is odd the Polynomial Congruence Rule yields $$rm: mod b!+!1: color{#c00}{bequiv -1} Rightarrow {bf tilde {rm P}}(b) = color{#c00}b^n P(1/color{#c00}b) equiv (color{#c00}{-1})^n P(color{#c00}{-1})equiv {-}P(-1),:$$ therefore we conclude that $rm P(b) + {bf tilde {rm P}}(b)equiv P(-1)-P(-1)equiv 0.,$ OP is case $rm,b=10, n=1$.



      Remark $ $ Essentially we have twice applied the radix $rm,b,$ analog of casting out elevens (the analog of casting out nines).






      share|cite|improve this answer











      $endgroup$


















        2












        $begingroup$

        More generally, recall that the radix $rm,b,$ digit string $rm d_n cdots d_1 d_0 $ denotes a polynomial expression $rm P(b) = d_n b^n +:cdots: + d_1 b + d_0,, $ where $rm P(x) = d_n x^n +cdots+ d_1 x + d_0., $ Recall the reversed (digits) polynomial is $rm {bf tilde {rm P}}(x) = x^n P(1/x).,$ If $rm:n:$ is odd the Polynomial Congruence Rule yields $$rm: mod b!+!1: color{#c00}{bequiv -1} Rightarrow {bf tilde {rm P}}(b) = color{#c00}b^n P(1/color{#c00}b) equiv (color{#c00}{-1})^n P(color{#c00}{-1})equiv {-}P(-1),:$$ therefore we conclude that $rm P(b) + {bf tilde {rm P}}(b)equiv P(-1)-P(-1)equiv 0.,$ OP is case $rm,b=10, n=1$.



        Remark $ $ Essentially we have twice applied the radix $rm,b,$ analog of casting out elevens (the analog of casting out nines).






        share|cite|improve this answer











        $endgroup$
















          2












          2








          2





          $begingroup$

          More generally, recall that the radix $rm,b,$ digit string $rm d_n cdots d_1 d_0 $ denotes a polynomial expression $rm P(b) = d_n b^n +:cdots: + d_1 b + d_0,, $ where $rm P(x) = d_n x^n +cdots+ d_1 x + d_0., $ Recall the reversed (digits) polynomial is $rm {bf tilde {rm P}}(x) = x^n P(1/x).,$ If $rm:n:$ is odd the Polynomial Congruence Rule yields $$rm: mod b!+!1: color{#c00}{bequiv -1} Rightarrow {bf tilde {rm P}}(b) = color{#c00}b^n P(1/color{#c00}b) equiv (color{#c00}{-1})^n P(color{#c00}{-1})equiv {-}P(-1),:$$ therefore we conclude that $rm P(b) + {bf tilde {rm P}}(b)equiv P(-1)-P(-1)equiv 0.,$ OP is case $rm,b=10, n=1$.



          Remark $ $ Essentially we have twice applied the radix $rm,b,$ analog of casting out elevens (the analog of casting out nines).






          share|cite|improve this answer











          $endgroup$



          More generally, recall that the radix $rm,b,$ digit string $rm d_n cdots d_1 d_0 $ denotes a polynomial expression $rm P(b) = d_n b^n +:cdots: + d_1 b + d_0,, $ where $rm P(x) = d_n x^n +cdots+ d_1 x + d_0., $ Recall the reversed (digits) polynomial is $rm {bf tilde {rm P}}(x) = x^n P(1/x).,$ If $rm:n:$ is odd the Polynomial Congruence Rule yields $$rm: mod b!+!1: color{#c00}{bequiv -1} Rightarrow {bf tilde {rm P}}(b) = color{#c00}b^n P(1/color{#c00}b) equiv (color{#c00}{-1})^n P(color{#c00}{-1})equiv {-}P(-1),:$$ therefore we conclude that $rm P(b) + {bf tilde {rm P}}(b)equiv P(-1)-P(-1)equiv 0.,$ OP is case $rm,b=10, n=1$.



          Remark $ $ Essentially we have twice applied the radix $rm,b,$ analog of casting out elevens (the analog of casting out nines).







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Apr 6 at 20:23

























          answered Apr 6 at 16:34









          Bill DubuqueBill Dubuque

          214k29198660




          214k29198660























              11












              $begingroup$

              It's simpler than you are making it...and no congruences are needed:



              We have $$overline {AB}=10A+B quad &quad overline {BA}=10B+A$$



              It follows that $$overline {AB}+overline {BA}=11times (A+B)$$ and we are done.






              share|cite|improve this answer











              $endgroup$













              • $begingroup$
                Very clean, totally escaped me!
                $endgroup$
                – André Armatowski
                Apr 6 at 16:20
















              11












              $begingroup$

              It's simpler than you are making it...and no congruences are needed:



              We have $$overline {AB}=10A+B quad &quad overline {BA}=10B+A$$



              It follows that $$overline {AB}+overline {BA}=11times (A+B)$$ and we are done.






              share|cite|improve this answer











              $endgroup$













              • $begingroup$
                Very clean, totally escaped me!
                $endgroup$
                – André Armatowski
                Apr 6 at 16:20














              11












              11








              11





              $begingroup$

              It's simpler than you are making it...and no congruences are needed:



              We have $$overline {AB}=10A+B quad &quad overline {BA}=10B+A$$



              It follows that $$overline {AB}+overline {BA}=11times (A+B)$$ and we are done.






              share|cite|improve this answer











              $endgroup$



              It's simpler than you are making it...and no congruences are needed:



              We have $$overline {AB}=10A+B quad &quad overline {BA}=10B+A$$



              It follows that $$overline {AB}+overline {BA}=11times (A+B)$$ and we are done.







              share|cite|improve this answer














              share|cite|improve this answer



              share|cite|improve this answer








              edited Apr 6 at 16:20

























              answered Apr 6 at 16:19









              lulululu

              44k25182




              44k25182












              • $begingroup$
                Very clean, totally escaped me!
                $endgroup$
                – André Armatowski
                Apr 6 at 16:20


















              • $begingroup$
                Very clean, totally escaped me!
                $endgroup$
                – André Armatowski
                Apr 6 at 16:20
















              $begingroup$
              Very clean, totally escaped me!
              $endgroup$
              – André Armatowski
              Apr 6 at 16:20




              $begingroup$
              Very clean, totally escaped me!
              $endgroup$
              – André Armatowski
              Apr 6 at 16:20











              2












              $begingroup$

              You can easily push through what you were trying though. Say your numbers are $AB$ and $BA$. If $A+Bgt 10$, then write it as $A+B=10+c$; note that $0leq cleq 8$, because two digits cannot add to $19$. That means that when you do the carry, the second digit is $(c+1)$, and so $AB+BA$ will be a three digit number: $1$, then $c+1$, and then $c$. At this point, your test gives you $1-(c+1)+c = 0$, so you get a multiple of $11$.






              share|cite|improve this answer









              $endgroup$


















                2












                $begingroup$

                You can easily push through what you were trying though. Say your numbers are $AB$ and $BA$. If $A+Bgt 10$, then write it as $A+B=10+c$; note that $0leq cleq 8$, because two digits cannot add to $19$. That means that when you do the carry, the second digit is $(c+1)$, and so $AB+BA$ will be a three digit number: $1$, then $c+1$, and then $c$. At this point, your test gives you $1-(c+1)+c = 0$, so you get a multiple of $11$.






                share|cite|improve this answer









                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  You can easily push through what you were trying though. Say your numbers are $AB$ and $BA$. If $A+Bgt 10$, then write it as $A+B=10+c$; note that $0leq cleq 8$, because two digits cannot add to $19$. That means that when you do the carry, the second digit is $(c+1)$, and so $AB+BA$ will be a three digit number: $1$, then $c+1$, and then $c$. At this point, your test gives you $1-(c+1)+c = 0$, so you get a multiple of $11$.






                  share|cite|improve this answer









                  $endgroup$



                  You can easily push through what you were trying though. Say your numbers are $AB$ and $BA$. If $A+Bgt 10$, then write it as $A+B=10+c$; note that $0leq cleq 8$, because two digits cannot add to $19$. That means that when you do the carry, the second digit is $(c+1)$, and so $AB+BA$ will be a three digit number: $1$, then $c+1$, and then $c$. At this point, your test gives you $1-(c+1)+c = 0$, so you get a multiple of $11$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Apr 6 at 16:25









                  Arturo MagidinArturo Magidin

                  267k34591922




                  267k34591922






























                      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%2f3177167%2fcan-divisibility-rules-for-digits-be-generalized-to-sum-of-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

                      "Incorrect syntax near the keyword 'ON'. (on update cascade, on delete cascade,)

                      Alcedinidae

                      Origin of the phrase “under your belt”?