Checking the proof of: find all primes $p$ such that $p^2mid 5^{p^2} +1$












2












$begingroup$



Find all primes $p$ such that $$p^2 mid 5^{p^2} +1$$




Okay, so I got this:



$x = 5^{p^2} +1 = (5^p)^p +1$. In order to use Eulers theorem, I checked that $(5^p, p^2) = 1$, which is true when $p ne 5$.
So, because $varphi(p^2) = p$, it follows that $(5^p)^p + 1 equiv 1 + 1 equiv 2 (modp)$. So, when $pne5$, $x$ is not divisible by $p^2$.
Easy to check that it's not divisible for $p=5$.



My textbook says that answer is $p=3$, which is true when I plug it into $x$.
So what's wrong with my try ?
If the whole approach is wrong, please post solution to this problem, as my textbook only gives final result.






elementary-number-theory divisibility







share|cite|improve this question











$endgroup$

















    2












    $begingroup$



    Find all primes $p$ such that $$p^2 mid 5^{p^2} +1$$




    Okay, so I got this:



    $x = 5^{p^2} +1 = (5^p)^p +1$. In order to use Eulers theorem, I checked that $(5^p, p^2) = 1$, which is true when $p ne 5$.
    So, because $varphi(p^2) = p$, it follows that $(5^p)^p + 1 equiv 1 + 1 equiv 2 (modp)$. So, when $pne5$, $x$ is not divisible by $p^2$.
    Easy to check that it's not divisible for $p=5$.



    My textbook says that answer is $p=3$, which is true when I plug it into $x$.
    So what's wrong with my try ?
    If the whole approach is wrong, please post solution to this problem, as my textbook only gives final result.






    elementary-number-theory divisibility







    share|cite|improve this question











    $endgroup$















      2












      2








      2


      1



      $begingroup$



      Find all primes $p$ such that $$p^2 mid 5^{p^2} +1$$




      Okay, so I got this:



      $x = 5^{p^2} +1 = (5^p)^p +1$. In order to use Eulers theorem, I checked that $(5^p, p^2) = 1$, which is true when $p ne 5$.
      So, because $varphi(p^2) = p$, it follows that $(5^p)^p + 1 equiv 1 + 1 equiv 2 (modp)$. So, when $pne5$, $x$ is not divisible by $p^2$.
      Easy to check that it's not divisible for $p=5$.



      My textbook says that answer is $p=3$, which is true when I plug it into $x$.
      So what's wrong with my try ?
      If the whole approach is wrong, please post solution to this problem, as my textbook only gives final result.






      elementary-number-theory divisibility







      share|cite|improve this question











      $endgroup$





      Find all primes $p$ such that $$p^2 mid 5^{p^2} +1$$




      Okay, so I got this:



      $x = 5^{p^2} +1 = (5^p)^p +1$. In order to use Eulers theorem, I checked that $(5^p, p^2) = 1$, which is true when $p ne 5$.
      So, because $varphi(p^2) = p$, it follows that $(5^p)^p + 1 equiv 1 + 1 equiv 2 (modp)$. So, when $pne5$, $x$ is not divisible by $p^2$.
      Easy to check that it's not divisible for $p=5$.



      My textbook says that answer is $p=3$, which is true when I plug it into $x$.
      So what's wrong with my try ?
      If the whole approach is wrong, please post solution to this problem, as my textbook only gives final result.






      elementary-number-theory divisibility




      elementary-number-theory divisibility






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 19 '18 at 17:55









      greedoid

      42.7k1153105




      42.7k1153105










      asked Dec 19 '18 at 17:31







      user626177





























          3 Answers
          3






          active

          oldest

          votes


















          2












          $begingroup$

          Clearly, $pne5$. Then Fermat gives
          $$
          -1 equiv 5^{p^2} equiv (5^{p}){^p} equiv 5^{p} equiv 5 bmod p
          $$
          and so $p$ divides $6$. Now $p=2$ does not work but $p=3$ does work.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            That's right, thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 17:46










          • $begingroup$
            $p=2$ does not work because $a^2not equiv 2 pmod 4$
            $endgroup$
            – Maged Saeed
            Dec 20 '18 at 4:39





















          0












          $begingroup$

          It is not correct since $varphi(p^2) = p(color{red}{p-1})$, but you can repair it easly.



          All congruences are modulo $p^2$. So we have by Euler (since $pne 5$)



          $$ 5^{p^2-p} equiv -1 implies 5^pequiv 5^{p^2}equiv -1$$



          So $pmid 5^p+1$, but by Fermat little theorem we have $pmid 5^p-5$ so $$pmid (5^p+1)-(5^p-5) = 6 implies p=2;;{rm or};;p=3$$



          Only $p=3$ works...






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Holy **** that was stupid. I'll try fixing it now
            $endgroup$
            – user626177
            Dec 19 '18 at 17:36



















          0












          $begingroup$

          If $5^{p^2} + 1$ is divisible by $p^2$, it must also be divisible by $p$



          Freshman's dream...



          Over a finite fields:



          $(a + b)^{p^n}equiv a^{p^n} + b^{p^n} pmod{p}$



          $5^{p^2} + 1^{p^2} equiv (5+1)^{p^2}equiv 0 pmod p$



          $p$ divides $6$



          leaving us with only 2 candidates to check.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Never heard of it, will check it out. Seems like an overkill for problems I need to do. Thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 19:13






          • 1




            $begingroup$
            Usually, the Freshman's dream is written as $(a+b)^2 = a^2+ b^2$ which is of course the mistake that a high-school freshman would make in his algebra class. But, oddly enough is true over rings with the right characteristic.
            $endgroup$
            – Doug M
            Dec 19 '18 at 20:55













          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%2f3046648%2fchecking-the-proof-of-find-all-primes-p-such-that-p2-mid-5p2-1%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$

          Clearly, $pne5$. Then Fermat gives
          $$
          -1 equiv 5^{p^2} equiv (5^{p}){^p} equiv 5^{p} equiv 5 bmod p
          $$
          and so $p$ divides $6$. Now $p=2$ does not work but $p=3$ does work.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            That's right, thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 17:46










          • $begingroup$
            $p=2$ does not work because $a^2not equiv 2 pmod 4$
            $endgroup$
            – Maged Saeed
            Dec 20 '18 at 4:39


















          2












          $begingroup$

          Clearly, $pne5$. Then Fermat gives
          $$
          -1 equiv 5^{p^2} equiv (5^{p}){^p} equiv 5^{p} equiv 5 bmod p
          $$
          and so $p$ divides $6$. Now $p=2$ does not work but $p=3$ does work.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            That's right, thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 17:46










          • $begingroup$
            $p=2$ does not work because $a^2not equiv 2 pmod 4$
            $endgroup$
            – Maged Saeed
            Dec 20 '18 at 4:39
















          2












          2








          2





          $begingroup$

          Clearly, $pne5$. Then Fermat gives
          $$
          -1 equiv 5^{p^2} equiv (5^{p}){^p} equiv 5^{p} equiv 5 bmod p
          $$
          and so $p$ divides $6$. Now $p=2$ does not work but $p=3$ does work.






          share|cite|improve this answer











          $endgroup$



          Clearly, $pne5$. Then Fermat gives
          $$
          -1 equiv 5^{p^2} equiv (5^{p}){^p} equiv 5^{p} equiv 5 bmod p
          $$
          and so $p$ divides $6$. Now $p=2$ does not work but $p=3$ does work.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 19 '18 at 17:47

























          answered Dec 19 '18 at 17:44









          lhflhf

          165k10171396




          165k10171396












          • $begingroup$
            That's right, thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 17:46










          • $begingroup$
            $p=2$ does not work because $a^2not equiv 2 pmod 4$
            $endgroup$
            – Maged Saeed
            Dec 20 '18 at 4:39




















          • $begingroup$
            That's right, thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 17:46










          • $begingroup$
            $p=2$ does not work because $a^2not equiv 2 pmod 4$
            $endgroup$
            – Maged Saeed
            Dec 20 '18 at 4:39


















          $begingroup$
          That's right, thanks!
          $endgroup$
          – user626177
          Dec 19 '18 at 17:46




          $begingroup$
          That's right, thanks!
          $endgroup$
          – user626177
          Dec 19 '18 at 17:46












          $begingroup$
          $p=2$ does not work because $a^2not equiv 2 pmod 4$
          $endgroup$
          – Maged Saeed
          Dec 20 '18 at 4:39






          $begingroup$
          $p=2$ does not work because $a^2not equiv 2 pmod 4$
          $endgroup$
          – Maged Saeed
          Dec 20 '18 at 4:39













          0












          $begingroup$

          It is not correct since $varphi(p^2) = p(color{red}{p-1})$, but you can repair it easly.



          All congruences are modulo $p^2$. So we have by Euler (since $pne 5$)



          $$ 5^{p^2-p} equiv -1 implies 5^pequiv 5^{p^2}equiv -1$$



          So $pmid 5^p+1$, but by Fermat little theorem we have $pmid 5^p-5$ so $$pmid (5^p+1)-(5^p-5) = 6 implies p=2;;{rm or};;p=3$$



          Only $p=3$ works...






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Holy **** that was stupid. I'll try fixing it now
            $endgroup$
            – user626177
            Dec 19 '18 at 17:36
















          0












          $begingroup$

          It is not correct since $varphi(p^2) = p(color{red}{p-1})$, but you can repair it easly.



          All congruences are modulo $p^2$. So we have by Euler (since $pne 5$)



          $$ 5^{p^2-p} equiv -1 implies 5^pequiv 5^{p^2}equiv -1$$



          So $pmid 5^p+1$, but by Fermat little theorem we have $pmid 5^p-5$ so $$pmid (5^p+1)-(5^p-5) = 6 implies p=2;;{rm or};;p=3$$



          Only $p=3$ works...






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Holy **** that was stupid. I'll try fixing it now
            $endgroup$
            – user626177
            Dec 19 '18 at 17:36














          0












          0








          0





          $begingroup$

          It is not correct since $varphi(p^2) = p(color{red}{p-1})$, but you can repair it easly.



          All congruences are modulo $p^2$. So we have by Euler (since $pne 5$)



          $$ 5^{p^2-p} equiv -1 implies 5^pequiv 5^{p^2}equiv -1$$



          So $pmid 5^p+1$, but by Fermat little theorem we have $pmid 5^p-5$ so $$pmid (5^p+1)-(5^p-5) = 6 implies p=2;;{rm or};;p=3$$



          Only $p=3$ works...






          share|cite|improve this answer











          $endgroup$



          It is not correct since $varphi(p^2) = p(color{red}{p-1})$, but you can repair it easly.



          All congruences are modulo $p^2$. So we have by Euler (since $pne 5$)



          $$ 5^{p^2-p} equiv -1 implies 5^pequiv 5^{p^2}equiv -1$$



          So $pmid 5^p+1$, but by Fermat little theorem we have $pmid 5^p-5$ so $$pmid (5^p+1)-(5^p-5) = 6 implies p=2;;{rm or};;p=3$$



          Only $p=3$ works...







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 19 '18 at 17:46

























          answered Dec 19 '18 at 17:34









          greedoidgreedoid

          42.7k1153105




          42.7k1153105












          • $begingroup$
            Holy **** that was stupid. I'll try fixing it now
            $endgroup$
            – user626177
            Dec 19 '18 at 17:36


















          • $begingroup$
            Holy **** that was stupid. I'll try fixing it now
            $endgroup$
            – user626177
            Dec 19 '18 at 17:36
















          $begingroup$
          Holy **** that was stupid. I'll try fixing it now
          $endgroup$
          – user626177
          Dec 19 '18 at 17:36




          $begingroup$
          Holy **** that was stupid. I'll try fixing it now
          $endgroup$
          – user626177
          Dec 19 '18 at 17:36











          0












          $begingroup$

          If $5^{p^2} + 1$ is divisible by $p^2$, it must also be divisible by $p$



          Freshman's dream...



          Over a finite fields:



          $(a + b)^{p^n}equiv a^{p^n} + b^{p^n} pmod{p}$



          $5^{p^2} + 1^{p^2} equiv (5+1)^{p^2}equiv 0 pmod p$



          $p$ divides $6$



          leaving us with only 2 candidates to check.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Never heard of it, will check it out. Seems like an overkill for problems I need to do. Thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 19:13






          • 1




            $begingroup$
            Usually, the Freshman's dream is written as $(a+b)^2 = a^2+ b^2$ which is of course the mistake that a high-school freshman would make in his algebra class. But, oddly enough is true over rings with the right characteristic.
            $endgroup$
            – Doug M
            Dec 19 '18 at 20:55


















          0












          $begingroup$

          If $5^{p^2} + 1$ is divisible by $p^2$, it must also be divisible by $p$



          Freshman's dream...



          Over a finite fields:



          $(a + b)^{p^n}equiv a^{p^n} + b^{p^n} pmod{p}$



          $5^{p^2} + 1^{p^2} equiv (5+1)^{p^2}equiv 0 pmod p$



          $p$ divides $6$



          leaving us with only 2 candidates to check.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Never heard of it, will check it out. Seems like an overkill for problems I need to do. Thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 19:13






          • 1




            $begingroup$
            Usually, the Freshman's dream is written as $(a+b)^2 = a^2+ b^2$ which is of course the mistake that a high-school freshman would make in his algebra class. But, oddly enough is true over rings with the right characteristic.
            $endgroup$
            – Doug M
            Dec 19 '18 at 20:55
















          0












          0








          0





          $begingroup$

          If $5^{p^2} + 1$ is divisible by $p^2$, it must also be divisible by $p$



          Freshman's dream...



          Over a finite fields:



          $(a + b)^{p^n}equiv a^{p^n} + b^{p^n} pmod{p}$



          $5^{p^2} + 1^{p^2} equiv (5+1)^{p^2}equiv 0 pmod p$



          $p$ divides $6$



          leaving us with only 2 candidates to check.






          share|cite|improve this answer









          $endgroup$



          If $5^{p^2} + 1$ is divisible by $p^2$, it must also be divisible by $p$



          Freshman's dream...



          Over a finite fields:



          $(a + b)^{p^n}equiv a^{p^n} + b^{p^n} pmod{p}$



          $5^{p^2} + 1^{p^2} equiv (5+1)^{p^2}equiv 0 pmod p$



          $p$ divides $6$



          leaving us with only 2 candidates to check.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 19 '18 at 17:57









          Doug MDoug M

          45.2k31854




          45.2k31854












          • $begingroup$
            Never heard of it, will check it out. Seems like an overkill for problems I need to do. Thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 19:13






          • 1




            $begingroup$
            Usually, the Freshman's dream is written as $(a+b)^2 = a^2+ b^2$ which is of course the mistake that a high-school freshman would make in his algebra class. But, oddly enough is true over rings with the right characteristic.
            $endgroup$
            – Doug M
            Dec 19 '18 at 20:55




















          • $begingroup$
            Never heard of it, will check it out. Seems like an overkill for problems I need to do. Thanks!
            $endgroup$
            – user626177
            Dec 19 '18 at 19:13






          • 1




            $begingroup$
            Usually, the Freshman's dream is written as $(a+b)^2 = a^2+ b^2$ which is of course the mistake that a high-school freshman would make in his algebra class. But, oddly enough is true over rings with the right characteristic.
            $endgroup$
            – Doug M
            Dec 19 '18 at 20:55


















          $begingroup$
          Never heard of it, will check it out. Seems like an overkill for problems I need to do. Thanks!
          $endgroup$
          – user626177
          Dec 19 '18 at 19:13




          $begingroup$
          Never heard of it, will check it out. Seems like an overkill for problems I need to do. Thanks!
          $endgroup$
          – user626177
          Dec 19 '18 at 19:13




          1




          1




          $begingroup$
          Usually, the Freshman's dream is written as $(a+b)^2 = a^2+ b^2$ which is of course the mistake that a high-school freshman would make in his algebra class. But, oddly enough is true over rings with the right characteristic.
          $endgroup$
          – Doug M
          Dec 19 '18 at 20:55






          $begingroup$
          Usually, the Freshman's dream is written as $(a+b)^2 = a^2+ b^2$ which is of course the mistake that a high-school freshman would make in his algebra class. But, oddly enough is true over rings with the right characteristic.
          $endgroup$
          – Doug M
          Dec 19 '18 at 20:55




















          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%2f3046648%2fchecking-the-proof-of-find-all-primes-p-such-that-p2-mid-5p2-1%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

          Quarter-circle Tiles

          Image
          up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
          Read more

          build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

          Image
          0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
          Read more

          Mont Emei

          Image
          Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
          Read more