Does there exist a perfect square of the form $5+40n$? [on hold]

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite
1












Does there exist a perfect square of the form $5+40n$ for positive integers $n$? I know this is probably easy to show but any help is appreciated







share|cite|improve this question














put on hold as off-topic by user21820, Jendrik Stelzner, amWhy, John Ma, Did 2 days ago


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – user21820, Jendrik Stelzner, amWhy, John Ma, Did
If this question can be reworded to fit the rules in the help center, please edit the question.
















    up vote
    0
    down vote

    favorite
    1












    Does there exist a perfect square of the form $5+40n$ for positive integers $n$? I know this is probably easy to show but any help is appreciated







    share|cite|improve this question














    put on hold as off-topic by user21820, Jendrik Stelzner, amWhy, John Ma, Did 2 days ago


    This question appears to be off-topic. The users who voted to close gave this specific reason:


    • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – user21820, Jendrik Stelzner, amWhy, John Ma, Did
    If this question can be reworded to fit the rules in the help center, please edit the question.














      up vote
      0
      down vote

      favorite
      1









      up vote
      0
      down vote

      favorite
      1






      1





      Does there exist a perfect square of the form $5+40n$ for positive integers $n$? I know this is probably easy to show but any help is appreciated







      share|cite|improve this question














      Does there exist a perfect square of the form $5+40n$ for positive integers $n$? I know this is probably easy to show but any help is appreciated









      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Aug 10 at 20:31









      barto

      13.3k32581




      13.3k32581










      asked Aug 10 at 19:13









      argamon

      655




      655




      put on hold as off-topic by user21820, Jendrik Stelzner, amWhy, John Ma, Did 2 days ago


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – user21820, Jendrik Stelzner, amWhy, John Ma, Did
      If this question can be reworded to fit the rules in the help center, please edit the question.




      put on hold as off-topic by user21820, Jendrik Stelzner, amWhy, John Ma, Did 2 days ago


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – user21820, Jendrik Stelzner, amWhy, John Ma, Did
      If this question can be reworded to fit the rules in the help center, please edit the question.




















          4 Answers
          4






          active

          oldest

          votes

















          up vote
          1
          down vote



          accepted










          What are the squares modulo $40$? Look in the OEIS to find http://oeis.org/A070462



          $$0, 1, 4, 9, 16, 25, 36, 9, 24, 1, 20, 1, 24, 9, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, ldots$$



          This tells us that there are squares of the form $40n + 1$, $40n + 4$, $40n + 9$, etc. There's no $40n + 5$.



          If there was, the square root would have to be an odd multiple of $5$. But we find that $5^2 equiv 25 pmod40$, $15^2 equiv 25 pmod40$ also, $25^2 equiv 25 pmod40$ and $35^2 equiv 25 pmod40$ also!






          share|cite|improve this answer
















          • 1




            Are you serious? You are going to look squares modulo 40? And use OEIS for that? Come on...
            – user582949
            Aug 10 at 20:33

















          up vote
          4
          down vote













          If such a perfect square existed that would imply that $a^2=5mod8$ has a solution which is not true (if you don't have much background just check it by hand).






          share|cite|improve this answer



























            up vote
            4
            down vote













            If we write $40n+5 = a^2$ we get $a=5b$ so $8n+1 = 5b^2;;(*)$ and thus $5mid 8n+1$.



            From here we get $$5mid 2(8n+1)-15n = n+2$$ so we can write $n+2=5k$. If we put $n=5k-2$ in to equation (*) we get: $$ 8k-3=b^2$$ Now $$b equiv_8 0,pm1,pm2pm3,4implies b^2 equiv_8 0,1,4notequiv -3$$






            share|cite|improve this answer





























              up vote
              1
              down vote













              Let $40n+5=x^2$. Then for this to be true we need to find modular square roots of $5$ modulo $40$. That is
              $$x^2equiv5pmod40tag1$$
              Now if a congruence holds modulo $m$, it also holds modulo any divisor of $m$. Hence $(1)$ is equivalent to finding solutions to
              $$x^2equiv5equiv0pmod5quadtextandquad x^2equiv5pmod8 tag2$$
              We find $0$ to be a modular square root of $5$ modulo $5$, and to check for modular square roots of $5$ modulo $8$, we find the squares of the residues $pm1$, $pm2$, $pm3$, $pm4$ modulo $8$ give $0$, $1$, $4$, none of which is $equiv5pmod8$.



              Hence $40n+5=x^2$ has no solutions in positive integers.






              share|cite|improve this answer



























                4 Answers
                4






                active

                oldest

                votes








                4 Answers
                4






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes








                up vote
                1
                down vote



                accepted










                What are the squares modulo $40$? Look in the OEIS to find http://oeis.org/A070462



                $$0, 1, 4, 9, 16, 25, 36, 9, 24, 1, 20, 1, 24, 9, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, ldots$$



                This tells us that there are squares of the form $40n + 1$, $40n + 4$, $40n + 9$, etc. There's no $40n + 5$.



                If there was, the square root would have to be an odd multiple of $5$. But we find that $5^2 equiv 25 pmod40$, $15^2 equiv 25 pmod40$ also, $25^2 equiv 25 pmod40$ and $35^2 equiv 25 pmod40$ also!






                share|cite|improve this answer
















                • 1




                  Are you serious? You are going to look squares modulo 40? And use OEIS for that? Come on...
                  – user582949
                  Aug 10 at 20:33














                up vote
                1
                down vote



                accepted










                What are the squares modulo $40$? Look in the OEIS to find http://oeis.org/A070462



                $$0, 1, 4, 9, 16, 25, 36, 9, 24, 1, 20, 1, 24, 9, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, ldots$$



                This tells us that there are squares of the form $40n + 1$, $40n + 4$, $40n + 9$, etc. There's no $40n + 5$.



                If there was, the square root would have to be an odd multiple of $5$. But we find that $5^2 equiv 25 pmod40$, $15^2 equiv 25 pmod40$ also, $25^2 equiv 25 pmod40$ and $35^2 equiv 25 pmod40$ also!






                share|cite|improve this answer
















                • 1




                  Are you serious? You are going to look squares modulo 40? And use OEIS for that? Come on...
                  – user582949
                  Aug 10 at 20:33












                up vote
                1
                down vote



                accepted







                up vote
                1
                down vote



                accepted






                What are the squares modulo $40$? Look in the OEIS to find http://oeis.org/A070462



                $$0, 1, 4, 9, 16, 25, 36, 9, 24, 1, 20, 1, 24, 9, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, ldots$$



                This tells us that there are squares of the form $40n + 1$, $40n + 4$, $40n + 9$, etc. There's no $40n + 5$.



                If there was, the square root would have to be an odd multiple of $5$. But we find that $5^2 equiv 25 pmod40$, $15^2 equiv 25 pmod40$ also, $25^2 equiv 25 pmod40$ and $35^2 equiv 25 pmod40$ also!






                share|cite|improve this answer












                What are the squares modulo $40$? Look in the OEIS to find http://oeis.org/A070462



                $$0, 1, 4, 9, 16, 25, 36, 9, 24, 1, 20, 1, 24, 9, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, ldots$$



                This tells us that there are squares of the form $40n + 1$, $40n + 4$, $40n + 9$, etc. There's no $40n + 5$.



                If there was, the square root would have to be an odd multiple of $5$. But we find that $5^2 equiv 25 pmod40$, $15^2 equiv 25 pmod40$ also, $25^2 equiv 25 pmod40$ and $35^2 equiv 25 pmod40$ also!







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Aug 10 at 20:27









                David R.

                6001728




                6001728







                • 1




                  Are you serious? You are going to look squares modulo 40? And use OEIS for that? Come on...
                  – user582949
                  Aug 10 at 20:33












                • 1




                  Are you serious? You are going to look squares modulo 40? And use OEIS for that? Come on...
                  – user582949
                  Aug 10 at 20:33







                1




                1




                Are you serious? You are going to look squares modulo 40? And use OEIS for that? Come on...
                – user582949
                Aug 10 at 20:33




                Are you serious? You are going to look squares modulo 40? And use OEIS for that? Come on...
                – user582949
                Aug 10 at 20:33










                up vote
                4
                down vote













                If such a perfect square existed that would imply that $a^2=5mod8$ has a solution which is not true (if you don't have much background just check it by hand).






                share|cite|improve this answer
























                  up vote
                  4
                  down vote













                  If such a perfect square existed that would imply that $a^2=5mod8$ has a solution which is not true (if you don't have much background just check it by hand).






                  share|cite|improve this answer






















                    up vote
                    4
                    down vote










                    up vote
                    4
                    down vote









                    If such a perfect square existed that would imply that $a^2=5mod8$ has a solution which is not true (if you don't have much background just check it by hand).






                    share|cite|improve this answer












                    If such a perfect square existed that would imply that $a^2=5mod8$ has a solution which is not true (if you don't have much background just check it by hand).







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Aug 10 at 19:30









                    Μάρκος Καραμέρης

                    4149




                    4149




















                        up vote
                        4
                        down vote













                        If we write $40n+5 = a^2$ we get $a=5b$ so $8n+1 = 5b^2;;(*)$ and thus $5mid 8n+1$.



                        From here we get $$5mid 2(8n+1)-15n = n+2$$ so we can write $n+2=5k$. If we put $n=5k-2$ in to equation (*) we get: $$ 8k-3=b^2$$ Now $$b equiv_8 0,pm1,pm2pm3,4implies b^2 equiv_8 0,1,4notequiv -3$$






                        share|cite|improve this answer


























                          up vote
                          4
                          down vote













                          If we write $40n+5 = a^2$ we get $a=5b$ so $8n+1 = 5b^2;;(*)$ and thus $5mid 8n+1$.



                          From here we get $$5mid 2(8n+1)-15n = n+2$$ so we can write $n+2=5k$. If we put $n=5k-2$ in to equation (*) we get: $$ 8k-3=b^2$$ Now $$b equiv_8 0,pm1,pm2pm3,4implies b^2 equiv_8 0,1,4notequiv -3$$






                          share|cite|improve this answer
























                            up vote
                            4
                            down vote










                            up vote
                            4
                            down vote









                            If we write $40n+5 = a^2$ we get $a=5b$ so $8n+1 = 5b^2;;(*)$ and thus $5mid 8n+1$.



                            From here we get $$5mid 2(8n+1)-15n = n+2$$ so we can write $n+2=5k$. If we put $n=5k-2$ in to equation (*) we get: $$ 8k-3=b^2$$ Now $$b equiv_8 0,pm1,pm2pm3,4implies b^2 equiv_8 0,1,4notequiv -3$$






                            share|cite|improve this answer














                            If we write $40n+5 = a^2$ we get $a=5b$ so $8n+1 = 5b^2;;(*)$ and thus $5mid 8n+1$.



                            From here we get $$5mid 2(8n+1)-15n = n+2$$ so we can write $n+2=5k$. If we put $n=5k-2$ in to equation (*) we get: $$ 8k-3=b^2$$ Now $$b equiv_8 0,pm1,pm2pm3,4implies b^2 equiv_8 0,1,4notequiv -3$$







                            share|cite|improve this answer














                            share|cite|improve this answer



                            share|cite|improve this answer








                            edited Aug 10 at 20:34









                            Arnaud Mortier

                            19.3k22159




                            19.3k22159










                            answered Aug 10 at 19:34







                            user582949



























                                up vote
                                1
                                down vote













                                Let $40n+5=x^2$. Then for this to be true we need to find modular square roots of $5$ modulo $40$. That is
                                $$x^2equiv5pmod40tag1$$
                                Now if a congruence holds modulo $m$, it also holds modulo any divisor of $m$. Hence $(1)$ is equivalent to finding solutions to
                                $$x^2equiv5equiv0pmod5quadtextandquad x^2equiv5pmod8 tag2$$
                                We find $0$ to be a modular square root of $5$ modulo $5$, and to check for modular square roots of $5$ modulo $8$, we find the squares of the residues $pm1$, $pm2$, $pm3$, $pm4$ modulo $8$ give $0$, $1$, $4$, none of which is $equiv5pmod8$.



                                Hence $40n+5=x^2$ has no solutions in positive integers.






                                share|cite|improve this answer
























                                  up vote
                                  1
                                  down vote













                                  Let $40n+5=x^2$. Then for this to be true we need to find modular square roots of $5$ modulo $40$. That is
                                  $$x^2equiv5pmod40tag1$$
                                  Now if a congruence holds modulo $m$, it also holds modulo any divisor of $m$. Hence $(1)$ is equivalent to finding solutions to
                                  $$x^2equiv5equiv0pmod5quadtextandquad x^2equiv5pmod8 tag2$$
                                  We find $0$ to be a modular square root of $5$ modulo $5$, and to check for modular square roots of $5$ modulo $8$, we find the squares of the residues $pm1$, $pm2$, $pm3$, $pm4$ modulo $8$ give $0$, $1$, $4$, none of which is $equiv5pmod8$.



                                  Hence $40n+5=x^2$ has no solutions in positive integers.






                                  share|cite|improve this answer






















                                    up vote
                                    1
                                    down vote










                                    up vote
                                    1
                                    down vote









                                    Let $40n+5=x^2$. Then for this to be true we need to find modular square roots of $5$ modulo $40$. That is
                                    $$x^2equiv5pmod40tag1$$
                                    Now if a congruence holds modulo $m$, it also holds modulo any divisor of $m$. Hence $(1)$ is equivalent to finding solutions to
                                    $$x^2equiv5equiv0pmod5quadtextandquad x^2equiv5pmod8 tag2$$
                                    We find $0$ to be a modular square root of $5$ modulo $5$, and to check for modular square roots of $5$ modulo $8$, we find the squares of the residues $pm1$, $pm2$, $pm3$, $pm4$ modulo $8$ give $0$, $1$, $4$, none of which is $equiv5pmod8$.



                                    Hence $40n+5=x^2$ has no solutions in positive integers.






                                    share|cite|improve this answer












                                    Let $40n+5=x^2$. Then for this to be true we need to find modular square roots of $5$ modulo $40$. That is
                                    $$x^2equiv5pmod40tag1$$
                                    Now if a congruence holds modulo $m$, it also holds modulo any divisor of $m$. Hence $(1)$ is equivalent to finding solutions to
                                    $$x^2equiv5equiv0pmod5quadtextandquad x^2equiv5pmod8 tag2$$
                                    We find $0$ to be a modular square root of $5$ modulo $5$, and to check for modular square roots of $5$ modulo $8$, we find the squares of the residues $pm1$, $pm2$, $pm3$, $pm4$ modulo $8$ give $0$, $1$, $4$, none of which is $equiv5pmod8$.



                                    Hence $40n+5=x^2$ has no solutions in positive integers.







                                    share|cite|improve this answer












                                    share|cite|improve this answer



                                    share|cite|improve this answer










                                    answered Aug 11 at 22:08









                                    Daniel Buck

                                    2,3621625




                                    2,3621625












                                        這個網誌中的熱門文章

                                        How to combine Bézier curves to a surface?

                                        Carbon dioxide

                                        Why am i infinitely getting the same tweet with the Twitter Search API?