Divisibility rule












2












$begingroup$


Example: $2^1$=2 --> $2mid2$



If a number has their last digit divisible by 2, than the number is divisible by 2



$2^2$=4--> $4mid2$, $4mid4$



If a number has their last two digit divisible by 4, than the number is divisible by 4



$2^3$=8--> $8mid2$, $8mid4$ , $8mid8$



If a number has their last three digit divisible by 8, than the number is divisible by 8



and so on...




How would you word this into a conjecture?







divisibility exponentiation conjectures







share|cite|improve this question











$endgroup$












  • $begingroup$
    do you mean word the conjecture?, or the question title
    $endgroup$
    – Saketh Malyala
    Oct 27 '18 at 19:04












  • $begingroup$
    @SakethMalyala you are right. I worded that wrong.
    $endgroup$
    – DeNel
    Oct 27 '18 at 19:06






  • 2




    $begingroup$
    I mean, you can just say that for any natural $k$, if the last $k$ digits of a number are divisible by $2^k$, so is the whole number.
    $endgroup$
    – Don Thousand
    Oct 27 '18 at 19:07
















2












$begingroup$


Example: $2^1$=2 --> $2mid2$



If a number has their last digit divisible by 2, than the number is divisible by 2



$2^2$=4--> $4mid2$, $4mid4$



If a number has their last two digit divisible by 4, than the number is divisible by 4



$2^3$=8--> $8mid2$, $8mid4$ , $8mid8$



If a number has their last three digit divisible by 8, than the number is divisible by 8



and so on...




How would you word this into a conjecture?







divisibility exponentiation conjectures







share|cite|improve this question











$endgroup$












  • $begingroup$
    do you mean word the conjecture?, or the question title
    $endgroup$
    – Saketh Malyala
    Oct 27 '18 at 19:04












  • $begingroup$
    @SakethMalyala you are right. I worded that wrong.
    $endgroup$
    – DeNel
    Oct 27 '18 at 19:06






  • 2




    $begingroup$
    I mean, you can just say that for any natural $k$, if the last $k$ digits of a number are divisible by $2^k$, so is the whole number.
    $endgroup$
    – Don Thousand
    Oct 27 '18 at 19:07














2












2








2





$begingroup$


Example: $2^1$=2 --> $2mid2$



If a number has their last digit divisible by 2, than the number is divisible by 2



$2^2$=4--> $4mid2$, $4mid4$



If a number has their last two digit divisible by 4, than the number is divisible by 4



$2^3$=8--> $8mid2$, $8mid4$ , $8mid8$



If a number has their last three digit divisible by 8, than the number is divisible by 8



and so on...




How would you word this into a conjecture?







divisibility exponentiation conjectures







share|cite|improve this question











$endgroup$




Example: $2^1$=2 --> $2mid2$



If a number has their last digit divisible by 2, than the number is divisible by 2



$2^2$=4--> $4mid2$, $4mid4$



If a number has their last two digit divisible by 4, than the number is divisible by 4



$2^3$=8--> $8mid2$, $8mid4$ , $8mid8$



If a number has their last three digit divisible by 8, than the number is divisible by 8



and so on...




How would you word this into a conjecture?







divisibility exponentiation conjectures




divisibility exponentiation conjectures






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Oct 28 '18 at 8:35







DeNel

















asked Oct 27 '18 at 19:03









DeNelDeNel

616




616












  • $begingroup$
    do you mean word the conjecture?, or the question title
    $endgroup$
    – Saketh Malyala
    Oct 27 '18 at 19:04












  • $begingroup$
    @SakethMalyala you are right. I worded that wrong.
    $endgroup$
    – DeNel
    Oct 27 '18 at 19:06






  • 2




    $begingroup$
    I mean, you can just say that for any natural $k$, if the last $k$ digits of a number are divisible by $2^k$, so is the whole number.
    $endgroup$
    – Don Thousand
    Oct 27 '18 at 19:07


















  • $begingroup$
    do you mean word the conjecture?, or the question title
    $endgroup$
    – Saketh Malyala
    Oct 27 '18 at 19:04












  • $begingroup$
    @SakethMalyala you are right. I worded that wrong.
    $endgroup$
    – DeNel
    Oct 27 '18 at 19:06






  • 2




    $begingroup$
    I mean, you can just say that for any natural $k$, if the last $k$ digits of a number are divisible by $2^k$, so is the whole number.
    $endgroup$
    – Don Thousand
    Oct 27 '18 at 19:07
















$begingroup$
do you mean word the conjecture?, or the question title
$endgroup$
– Saketh Malyala
Oct 27 '18 at 19:04






$begingroup$
do you mean word the conjecture?, or the question title
$endgroup$
– Saketh Malyala
Oct 27 '18 at 19:04














$begingroup$
@SakethMalyala you are right. I worded that wrong.
$endgroup$
– DeNel
Oct 27 '18 at 19:06




$begingroup$
@SakethMalyala you are right. I worded that wrong.
$endgroup$
– DeNel
Oct 27 '18 at 19:06




2




2




$begingroup$
I mean, you can just say that for any natural $k$, if the last $k$ digits of a number are divisible by $2^k$, so is the whole number.
$endgroup$
– Don Thousand
Oct 27 '18 at 19:07




$begingroup$
I mean, you can just say that for any natural $k$, if the last $k$ digits of a number are divisible by $2^k$, so is the whole number.
$endgroup$
– Don Thousand
Oct 27 '18 at 19:07










3 Answers
3






active

oldest

votes


















1












$begingroup$

Your conjuncture is essentially a true statement. The formulation of the statement is in @Ethan Bolker's answer. Here is also a prove for the statement:




Each number having $n+1$ digits can be written as follows:



$$10^na_n + 10^{n-1}a_{n-1} + cdots+10a_1 + a_0 tag 1$$




  • Notice that we can extract $10$ from the first $n$ terms and the
    number will be $10m+a_0$ where $m = (10^{n-1}a_n + 10^{n-2}a_{n-1} +cdots+a_1)$. Now, if $2$ divides this number, $2$ shall divide
    its form, $10m+a_0$. However $2|10$, hence, it will divide $10m$.
    Therefore $a_0$ must be divisible by $2$ so that the number is
    divisible by $2$.


  • For the general case where $2^k$ divides $n$ if and only if $2^k$
    divides the last $k$ digits, extract $10^k$ from the first $n-k+1$
    terms, and follow the previous argument given that $2^k$ divides $10^k$ as $10^k = 2^ktimes5^k$.








share|cite|improve this answer











$endgroup$





















    0












    $begingroup$

    Your conjecture is (essentially) correct. You should be able to fill in the blank in




    If a number has their last ?? digit divisible by ??, than the number
    is divisible by $2^k$.




    But you are using the "$|$" symbol incorrectly. It means "divides", not "is divisible by", so
    $$
    4 mid8
    $$
    but
    $$
    8 nmid 4
    $$     .



    Finally, the statements you write after the arrows are true when you turn them around, but they don't prove the conjecture. Were you supposed to do that?






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      we have been using "$|$" meaning "factor of". That's how I was taught. Maybe I was give the wrong information.
      $endgroup$
      – DeNel
      Oct 27 '18 at 19:54










    • $begingroup$
      @DeNel If that's what you were taught then the source of your information is out of sync with the standard usage.
      $endgroup$
      – Ethan Bolker
      Oct 27 '18 at 20:16










    • $begingroup$
      Well, $2$ is a factor of $10$, and $2|10$. I guess it is a matter of @DeNel’s application of the definition.
      $endgroup$
      – Lubin
      Oct 27 '18 at 21:44






    • 1




      $begingroup$
      @Lubin I hurried. THe reading "is a factor of" is correct, of course. But then $ 8 | 4$, as written, is obviously wrong.
      $endgroup$
      – Ethan Bolker
      Oct 28 '18 at 2:29



















    0












    $begingroup$

    Hint $ 2^kmid a!+!10^k biff 2^kmid a, $ by $, 2^kmid 10^k = 2^k 5^k$



    Better $, abmod 2^k = (underbrace{abmod 10^k}_{large {rm first} k {rm digits}})bmod{ 2^k}$



    Better $, aequiv bpmod{!10^k},Rightarrow, aequiv bpmod{!2^k}$



    Better $, aequiv bpmod{!mn},Rightarrow, aequiv bpmod{!n}, $ by $, nmid mnmid a-b$



    e.g. $bmod 1001!: color{#c00}{10^{large 3}}!equiv -1 ,Rightarrow, a=12,013,002equiv 12(color{#c00}{10^{large 3}})^{large 2}!+13(color{#c00}{10^{large 3}})+2equiv 12!-!13!+!2equiv 1$



    so $ 7!cdot!13=10^2!-!10!+!1mid 10^3!+!1,Rightarrow, a bmod 13 = (a bmod 1001)bmod 13 = 1bmod 13 = 1$.



    In congruence language: $ aequiv 1pmod{!13j!=!!10^3!+!1},Rightarrow, aequiv 1pmod{!13}$



    That's the idea behind one divisibility test for $13$.






    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%2f2973765%2fdivisibility-rule%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









      1












      $begingroup$

      Your conjuncture is essentially a true statement. The formulation of the statement is in @Ethan Bolker's answer. Here is also a prove for the statement:




      Each number having $n+1$ digits can be written as follows:



      $$10^na_n + 10^{n-1}a_{n-1} + cdots+10a_1 + a_0 tag 1$$




      • Notice that we can extract $10$ from the first $n$ terms and the
        number will be $10m+a_0$ where $m = (10^{n-1}a_n + 10^{n-2}a_{n-1} +cdots+a_1)$. Now, if $2$ divides this number, $2$ shall divide
        its form, $10m+a_0$. However $2|10$, hence, it will divide $10m$.
        Therefore $a_0$ must be divisible by $2$ so that the number is
        divisible by $2$.


      • For the general case where $2^k$ divides $n$ if and only if $2^k$
        divides the last $k$ digits, extract $10^k$ from the first $n-k+1$
        terms, and follow the previous argument given that $2^k$ divides $10^k$ as $10^k = 2^ktimes5^k$.








      share|cite|improve this answer











      $endgroup$


















        1












        $begingroup$

        Your conjuncture is essentially a true statement. The formulation of the statement is in @Ethan Bolker's answer. Here is also a prove for the statement:




        Each number having $n+1$ digits can be written as follows:



        $$10^na_n + 10^{n-1}a_{n-1} + cdots+10a_1 + a_0 tag 1$$




        • Notice that we can extract $10$ from the first $n$ terms and the
          number will be $10m+a_0$ where $m = (10^{n-1}a_n + 10^{n-2}a_{n-1} +cdots+a_1)$. Now, if $2$ divides this number, $2$ shall divide
          its form, $10m+a_0$. However $2|10$, hence, it will divide $10m$.
          Therefore $a_0$ must be divisible by $2$ so that the number is
          divisible by $2$.


        • For the general case where $2^k$ divides $n$ if and only if $2^k$
          divides the last $k$ digits, extract $10^k$ from the first $n-k+1$
          terms, and follow the previous argument given that $2^k$ divides $10^k$ as $10^k = 2^ktimes5^k$.








        share|cite|improve this answer











        $endgroup$
















          1












          1








          1





          $begingroup$

          Your conjuncture is essentially a true statement. The formulation of the statement is in @Ethan Bolker's answer. Here is also a prove for the statement:




          Each number having $n+1$ digits can be written as follows:



          $$10^na_n + 10^{n-1}a_{n-1} + cdots+10a_1 + a_0 tag 1$$




          • Notice that we can extract $10$ from the first $n$ terms and the
            number will be $10m+a_0$ where $m = (10^{n-1}a_n + 10^{n-2}a_{n-1} +cdots+a_1)$. Now, if $2$ divides this number, $2$ shall divide
            its form, $10m+a_0$. However $2|10$, hence, it will divide $10m$.
            Therefore $a_0$ must be divisible by $2$ so that the number is
            divisible by $2$.


          • For the general case where $2^k$ divides $n$ if and only if $2^k$
            divides the last $k$ digits, extract $10^k$ from the first $n-k+1$
            terms, and follow the previous argument given that $2^k$ divides $10^k$ as $10^k = 2^ktimes5^k$.








          share|cite|improve this answer











          $endgroup$



          Your conjuncture is essentially a true statement. The formulation of the statement is in @Ethan Bolker's answer. Here is also a prove for the statement:




          Each number having $n+1$ digits can be written as follows:



          $$10^na_n + 10^{n-1}a_{n-1} + cdots+10a_1 + a_0 tag 1$$




          • Notice that we can extract $10$ from the first $n$ terms and the
            number will be $10m+a_0$ where $m = (10^{n-1}a_n + 10^{n-2}a_{n-1} +cdots+a_1)$. Now, if $2$ divides this number, $2$ shall divide
            its form, $10m+a_0$. However $2|10$, hence, it will divide $10m$.
            Therefore $a_0$ must be divisible by $2$ so that the number is
            divisible by $2$.


          • For the general case where $2^k$ divides $n$ if and only if $2^k$
            divides the last $k$ digits, extract $10^k$ from the first $n-k+1$
            terms, and follow the previous argument given that $2^k$ divides $10^k$ as $10^k = 2^ktimes5^k$.









          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Oct 27 '18 at 21:22

























          answered Oct 27 '18 at 19:36









          Maged SaeedMaged Saeed

          8471417




          8471417























              0












              $begingroup$

              Your conjecture is (essentially) correct. You should be able to fill in the blank in




              If a number has their last ?? digit divisible by ??, than the number
              is divisible by $2^k$.




              But you are using the "$|$" symbol incorrectly. It means "divides", not "is divisible by", so
              $$
              4 mid8
              $$
              but
              $$
              8 nmid 4
              $$               .



              Finally, the statements you write after the arrows are true when you turn them around, but they don't prove the conjecture. Were you supposed to do that?






              share|cite|improve this answer











              $endgroup$













              • $begingroup$
                we have been using "$|$" meaning "factor of". That's how I was taught. Maybe I was give the wrong information.
                $endgroup$
                – DeNel
                Oct 27 '18 at 19:54










              • $begingroup$
                @DeNel If that's what you were taught then the source of your information is out of sync with the standard usage.
                $endgroup$
                – Ethan Bolker
                Oct 27 '18 at 20:16










              • $begingroup$
                Well, $2$ is a factor of $10$, and $2|10$. I guess it is a matter of @DeNel’s application of the definition.
                $endgroup$
                – Lubin
                Oct 27 '18 at 21:44






              • 1




                $begingroup$
                @Lubin I hurried. THe reading "is a factor of" is correct, of course. But then $ 8 | 4$, as written, is obviously wrong.
                $endgroup$
                – Ethan Bolker
                Oct 28 '18 at 2:29
















              0












              $begingroup$

              Your conjecture is (essentially) correct. You should be able to fill in the blank in




              If a number has their last ?? digit divisible by ??, than the number
              is divisible by $2^k$.




              But you are using the "$|$" symbol incorrectly. It means "divides", not "is divisible by", so
              $$
              4 mid8
              $$
              but
              $$
              8 nmid 4
              $$               .



              Finally, the statements you write after the arrows are true when you turn them around, but they don't prove the conjecture. Were you supposed to do that?






              share|cite|improve this answer











              $endgroup$













              • $begingroup$
                we have been using "$|$" meaning "factor of". That's how I was taught. Maybe I was give the wrong information.
                $endgroup$
                – DeNel
                Oct 27 '18 at 19:54










              • $begingroup$
                @DeNel If that's what you were taught then the source of your information is out of sync with the standard usage.
                $endgroup$
                – Ethan Bolker
                Oct 27 '18 at 20:16










              • $begingroup$
                Well, $2$ is a factor of $10$, and $2|10$. I guess it is a matter of @DeNel’s application of the definition.
                $endgroup$
                – Lubin
                Oct 27 '18 at 21:44






              • 1




                $begingroup$
                @Lubin I hurried. THe reading "is a factor of" is correct, of course. But then $ 8 | 4$, as written, is obviously wrong.
                $endgroup$
                – Ethan Bolker
                Oct 28 '18 at 2:29














              0












              0








              0





              $begingroup$

              Your conjecture is (essentially) correct. You should be able to fill in the blank in




              If a number has their last ?? digit divisible by ??, than the number
              is divisible by $2^k$.




              But you are using the "$|$" symbol incorrectly. It means "divides", not "is divisible by", so
              $$
              4 mid8
              $$
              but
              $$
              8 nmid 4
              $$               .



              Finally, the statements you write after the arrows are true when you turn them around, but they don't prove the conjecture. Were you supposed to do that?






              share|cite|improve this answer











              $endgroup$



              Your conjecture is (essentially) correct. You should be able to fill in the blank in




              If a number has their last ?? digit divisible by ??, than the number
              is divisible by $2^k$.




              But you are using the "$|$" symbol incorrectly. It means "divides", not "is divisible by", so
              $$
              4 mid8
              $$
              but
              $$
              8 nmid 4
              $$               .



              Finally, the statements you write after the arrows are true when you turn them around, but they don't prove the conjecture. Were you supposed to do that?







              share|cite|improve this answer














              share|cite|improve this answer



              share|cite|improve this answer








              edited Oct 27 '18 at 19:09









              Arthur

              112k7109191




              112k7109191










              answered Oct 27 '18 at 19:08









              Ethan BolkerEthan Bolker

              42.2k548111




              42.2k548111












              • $begingroup$
                we have been using "$|$" meaning "factor of". That's how I was taught. Maybe I was give the wrong information.
                $endgroup$
                – DeNel
                Oct 27 '18 at 19:54










              • $begingroup$
                @DeNel If that's what you were taught then the source of your information is out of sync with the standard usage.
                $endgroup$
                – Ethan Bolker
                Oct 27 '18 at 20:16










              • $begingroup$
                Well, $2$ is a factor of $10$, and $2|10$. I guess it is a matter of @DeNel’s application of the definition.
                $endgroup$
                – Lubin
                Oct 27 '18 at 21:44






              • 1




                $begingroup$
                @Lubin I hurried. THe reading "is a factor of" is correct, of course. But then $ 8 | 4$, as written, is obviously wrong.
                $endgroup$
                – Ethan Bolker
                Oct 28 '18 at 2:29


















              • $begingroup$
                we have been using "$|$" meaning "factor of". That's how I was taught. Maybe I was give the wrong information.
                $endgroup$
                – DeNel
                Oct 27 '18 at 19:54










              • $begingroup$
                @DeNel If that's what you were taught then the source of your information is out of sync with the standard usage.
                $endgroup$
                – Ethan Bolker
                Oct 27 '18 at 20:16










              • $begingroup$
                Well, $2$ is a factor of $10$, and $2|10$. I guess it is a matter of @DeNel’s application of the definition.
                $endgroup$
                – Lubin
                Oct 27 '18 at 21:44






              • 1




                $begingroup$
                @Lubin I hurried. THe reading "is a factor of" is correct, of course. But then $ 8 | 4$, as written, is obviously wrong.
                $endgroup$
                – Ethan Bolker
                Oct 28 '18 at 2:29
















              $begingroup$
              we have been using "$|$" meaning "factor of". That's how I was taught. Maybe I was give the wrong information.
              $endgroup$
              – DeNel
              Oct 27 '18 at 19:54




              $begingroup$
              we have been using "$|$" meaning "factor of". That's how I was taught. Maybe I was give the wrong information.
              $endgroup$
              – DeNel
              Oct 27 '18 at 19:54












              $begingroup$
              @DeNel If that's what you were taught then the source of your information is out of sync with the standard usage.
              $endgroup$
              – Ethan Bolker
              Oct 27 '18 at 20:16




              $begingroup$
              @DeNel If that's what you were taught then the source of your information is out of sync with the standard usage.
              $endgroup$
              – Ethan Bolker
              Oct 27 '18 at 20:16












              $begingroup$
              Well, $2$ is a factor of $10$, and $2|10$. I guess it is a matter of @DeNel’s application of the definition.
              $endgroup$
              – Lubin
              Oct 27 '18 at 21:44




              $begingroup$
              Well, $2$ is a factor of $10$, and $2|10$. I guess it is a matter of @DeNel’s application of the definition.
              $endgroup$
              – Lubin
              Oct 27 '18 at 21:44




              1




              1




              $begingroup$
              @Lubin I hurried. THe reading "is a factor of" is correct, of course. But then $ 8 | 4$, as written, is obviously wrong.
              $endgroup$
              – Ethan Bolker
              Oct 28 '18 at 2:29




              $begingroup$
              @Lubin I hurried. THe reading "is a factor of" is correct, of course. But then $ 8 | 4$, as written, is obviously wrong.
              $endgroup$
              – Ethan Bolker
              Oct 28 '18 at 2:29











              0












              $begingroup$

              Hint $ 2^kmid a!+!10^k biff 2^kmid a, $ by $, 2^kmid 10^k = 2^k 5^k$



              Better $, abmod 2^k = (underbrace{abmod 10^k}_{large {rm first} k {rm digits}})bmod{ 2^k}$



              Better $, aequiv bpmod{!10^k},Rightarrow, aequiv bpmod{!2^k}$



              Better $, aequiv bpmod{!mn},Rightarrow, aequiv bpmod{!n}, $ by $, nmid mnmid a-b$



              e.g. $bmod 1001!: color{#c00}{10^{large 3}}!equiv -1 ,Rightarrow, a=12,013,002equiv 12(color{#c00}{10^{large 3}})^{large 2}!+13(color{#c00}{10^{large 3}})+2equiv 12!-!13!+!2equiv 1$



              so $ 7!cdot!13=10^2!-!10!+!1mid 10^3!+!1,Rightarrow, a bmod 13 = (a bmod 1001)bmod 13 = 1bmod 13 = 1$.



              In congruence language: $ aequiv 1pmod{!13j!=!!10^3!+!1},Rightarrow, aequiv 1pmod{!13}$



              That's the idea behind one divisibility test for $13$.






              share|cite|improve this answer











              $endgroup$


















                0












                $begingroup$

                Hint $ 2^kmid a!+!10^k biff 2^kmid a, $ by $, 2^kmid 10^k = 2^k 5^k$



                Better $, abmod 2^k = (underbrace{abmod 10^k}_{large {rm first} k {rm digits}})bmod{ 2^k}$



                Better $, aequiv bpmod{!10^k},Rightarrow, aequiv bpmod{!2^k}$



                Better $, aequiv bpmod{!mn},Rightarrow, aequiv bpmod{!n}, $ by $, nmid mnmid a-b$



                e.g. $bmod 1001!: color{#c00}{10^{large 3}}!equiv -1 ,Rightarrow, a=12,013,002equiv 12(color{#c00}{10^{large 3}})^{large 2}!+13(color{#c00}{10^{large 3}})+2equiv 12!-!13!+!2equiv 1$



                so $ 7!cdot!13=10^2!-!10!+!1mid 10^3!+!1,Rightarrow, a bmod 13 = (a bmod 1001)bmod 13 = 1bmod 13 = 1$.



                In congruence language: $ aequiv 1pmod{!13j!=!!10^3!+!1},Rightarrow, aequiv 1pmod{!13}$



                That's the idea behind one divisibility test for $13$.






                share|cite|improve this answer











                $endgroup$
















                  0












                  0








                  0





                  $begingroup$

                  Hint $ 2^kmid a!+!10^k biff 2^kmid a, $ by $, 2^kmid 10^k = 2^k 5^k$



                  Better $, abmod 2^k = (underbrace{abmod 10^k}_{large {rm first} k {rm digits}})bmod{ 2^k}$



                  Better $, aequiv bpmod{!10^k},Rightarrow, aequiv bpmod{!2^k}$



                  Better $, aequiv bpmod{!mn},Rightarrow, aequiv bpmod{!n}, $ by $, nmid mnmid a-b$



                  e.g. $bmod 1001!: color{#c00}{10^{large 3}}!equiv -1 ,Rightarrow, a=12,013,002equiv 12(color{#c00}{10^{large 3}})^{large 2}!+13(color{#c00}{10^{large 3}})+2equiv 12!-!13!+!2equiv 1$



                  so $ 7!cdot!13=10^2!-!10!+!1mid 10^3!+!1,Rightarrow, a bmod 13 = (a bmod 1001)bmod 13 = 1bmod 13 = 1$.



                  In congruence language: $ aequiv 1pmod{!13j!=!!10^3!+!1},Rightarrow, aequiv 1pmod{!13}$



                  That's the idea behind one divisibility test for $13$.






                  share|cite|improve this answer











                  $endgroup$



                  Hint $ 2^kmid a!+!10^k biff 2^kmid a, $ by $, 2^kmid 10^k = 2^k 5^k$



                  Better $, abmod 2^k = (underbrace{abmod 10^k}_{large {rm first} k {rm digits}})bmod{ 2^k}$



                  Better $, aequiv bpmod{!10^k},Rightarrow, aequiv bpmod{!2^k}$



                  Better $, aequiv bpmod{!mn},Rightarrow, aequiv bpmod{!n}, $ by $, nmid mnmid a-b$



                  e.g. $bmod 1001!: color{#c00}{10^{large 3}}!equiv -1 ,Rightarrow, a=12,013,002equiv 12(color{#c00}{10^{large 3}})^{large 2}!+13(color{#c00}{10^{large 3}})+2equiv 12!-!13!+!2equiv 1$



                  so $ 7!cdot!13=10^2!-!10!+!1mid 10^3!+!1,Rightarrow, a bmod 13 = (a bmod 1001)bmod 13 = 1bmod 13 = 1$.



                  In congruence language: $ aequiv 1pmod{!13j!=!!10^3!+!1},Rightarrow, aequiv 1pmod{!13}$



                  That's the idea behind one divisibility test for $13$.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Nov 25 '18 at 17:05

























                  answered Oct 27 '18 at 19:36









                  Bill DubuqueBill Dubuque

                  209k29191634




                  209k29191634






























                      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%2f2973765%2fdivisibility-rule%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

                      How to change which sound is reproduced for terminal bell?

                      Image
                      3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
                      Read more

                      Can I use Tabulator js library in my java Spring + Thymeleaf project?

                      Image
                      0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
                      Read more

                      Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

                      Image
                      up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx...
                      Read more