Prove that for all positive integers $n>1, (n^2+1)-n$ is not a perfect square.












0














In this hard question, I tried to use mathematical induction but couldn't as it is a hard problem. I have been trying for a week now so I came to stack exchange with this question. Any help would be nice.



Also the problems goes on and asks to prove for $2(n^2+1)-n$










share|cite|improve this question
























  • Did you really mean to write $1(n^2+1)-n$ or is there a typo?
    – bof
    yesterday










  • I think it is supposed to be all positive integers greater than $1$, as when $n=1$ it is a square.
    – Erik Parkinson
    yesterday










  • I forgot to add the second part
    – user587054
    yesterday
















0














In this hard question, I tried to use mathematical induction but couldn't as it is a hard problem. I have been trying for a week now so I came to stack exchange with this question. Any help would be nice.



Also the problems goes on and asks to prove for $2(n^2+1)-n$










share|cite|improve this question
























  • Did you really mean to write $1(n^2+1)-n$ or is there a typo?
    – bof
    yesterday










  • I think it is supposed to be all positive integers greater than $1$, as when $n=1$ it is a square.
    – Erik Parkinson
    yesterday










  • I forgot to add the second part
    – user587054
    yesterday














0












0








0







In this hard question, I tried to use mathematical induction but couldn't as it is a hard problem. I have been trying for a week now so I came to stack exchange with this question. Any help would be nice.



Also the problems goes on and asks to prove for $2(n^2+1)-n$










share|cite|improve this question















In this hard question, I tried to use mathematical induction but couldn't as it is a hard problem. I have been trying for a week now so I came to stack exchange with this question. Any help would be nice.



Also the problems goes on and asks to prove for $2(n^2+1)-n$







elementary-number-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited yesterday

























asked yesterday









user587054

47211




47211












  • Did you really mean to write $1(n^2+1)-n$ or is there a typo?
    – bof
    yesterday










  • I think it is supposed to be all positive integers greater than $1$, as when $n=1$ it is a square.
    – Erik Parkinson
    yesterday










  • I forgot to add the second part
    – user587054
    yesterday


















  • Did you really mean to write $1(n^2+1)-n$ or is there a typo?
    – bof
    yesterday










  • I think it is supposed to be all positive integers greater than $1$, as when $n=1$ it is a square.
    – Erik Parkinson
    yesterday










  • I forgot to add the second part
    – user587054
    yesterday
















Did you really mean to write $1(n^2+1)-n$ or is there a typo?
– bof
yesterday




Did you really mean to write $1(n^2+1)-n$ or is there a typo?
– bof
yesterday












I think it is supposed to be all positive integers greater than $1$, as when $n=1$ it is a square.
– Erik Parkinson
yesterday




I think it is supposed to be all positive integers greater than $1$, as when $n=1$ it is a square.
– Erik Parkinson
yesterday












I forgot to add the second part
– user587054
yesterday




I forgot to add the second part
– user587054
yesterday










3 Answers
3






active

oldest

votes


















3














The trick is that for all $n ge 2$,
$$(n-1)^2 = n^2-2n+1 < n^2-n+1 < n^2$$



So $n^2-n+1$ will lie between all consecutive square numbers and thus can't be square.






share|cite|improve this answer








New contributor




Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


























    1














    Note that for $n^2-n+1$ and $n >1$, the following inequality holds true:



    $$n^2-2n+1 < n^2-n+1 < n^2$$



    $$(n-1)^2 < n^2-n+1 < n^2$$



    where $(n-1)^2$ and $n^2$ are two consecutive squares. What can be concluded from this?






    share|cite|improve this answer























    • Thank you but can you please help me with the second part I updated on the post. Thank you anyways
      – user587054
      yesterday



















    0














    A hint for the second part. Consider the possibilities for $n pmod3$, that is, $n$ may be of the form $3k$, $3k+1$ or $3k+2$. Do any of these $n$ yield expressions for $2(n^2+1)-n$ that are possible squares $pmod3$? And if any is, is it also a possible square $pmod9$?






    share|cite|improve this answer





















      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%2f3062483%2fprove-that-for-all-positive-integers-n1-n21-n-is-not-a-perfect-square%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









      3














      The trick is that for all $n ge 2$,
      $$(n-1)^2 = n^2-2n+1 < n^2-n+1 < n^2$$



      So $n^2-n+1$ will lie between all consecutive square numbers and thus can't be square.






      share|cite|improve this answer








      New contributor




      Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.























        3














        The trick is that for all $n ge 2$,
        $$(n-1)^2 = n^2-2n+1 < n^2-n+1 < n^2$$



        So $n^2-n+1$ will lie between all consecutive square numbers and thus can't be square.






        share|cite|improve this answer








        New contributor




        Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
        Check out our Code of Conduct.





















          3












          3








          3






          The trick is that for all $n ge 2$,
          $$(n-1)^2 = n^2-2n+1 < n^2-n+1 < n^2$$



          So $n^2-n+1$ will lie between all consecutive square numbers and thus can't be square.






          share|cite|improve this answer








          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.









          The trick is that for all $n ge 2$,
          $$(n-1)^2 = n^2-2n+1 < n^2-n+1 < n^2$$



          So $n^2-n+1$ will lie between all consecutive square numbers and thus can't be square.







          share|cite|improve this answer








          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.









          share|cite|improve this answer



          share|cite|improve this answer






          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.









          answered yesterday









          Erik Parkinson

          9059




          9059




          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.





          New contributor





          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.






          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.























              1














              Note that for $n^2-n+1$ and $n >1$, the following inequality holds true:



              $$n^2-2n+1 < n^2-n+1 < n^2$$



              $$(n-1)^2 < n^2-n+1 < n^2$$



              where $(n-1)^2$ and $n^2$ are two consecutive squares. What can be concluded from this?






              share|cite|improve this answer























              • Thank you but can you please help me with the second part I updated on the post. Thank you anyways
                – user587054
                yesterday
















              1














              Note that for $n^2-n+1$ and $n >1$, the following inequality holds true:



              $$n^2-2n+1 < n^2-n+1 < n^2$$



              $$(n-1)^2 < n^2-n+1 < n^2$$



              where $(n-1)^2$ and $n^2$ are two consecutive squares. What can be concluded from this?






              share|cite|improve this answer























              • Thank you but can you please help me with the second part I updated on the post. Thank you anyways
                – user587054
                yesterday














              1












              1








              1






              Note that for $n^2-n+1$ and $n >1$, the following inequality holds true:



              $$n^2-2n+1 < n^2-n+1 < n^2$$



              $$(n-1)^2 < n^2-n+1 < n^2$$



              where $(n-1)^2$ and $n^2$ are two consecutive squares. What can be concluded from this?






              share|cite|improve this answer














              Note that for $n^2-n+1$ and $n >1$, the following inequality holds true:



              $$n^2-2n+1 < n^2-n+1 < n^2$$



              $$(n-1)^2 < n^2-n+1 < n^2$$



              where $(n-1)^2$ and $n^2$ are two consecutive squares. What can be concluded from this?







              share|cite|improve this answer














              share|cite|improve this answer



              share|cite|improve this answer








              edited yesterday

























              answered yesterday









              KM101

              5,5361423




              5,5361423












              • Thank you but can you please help me with the second part I updated on the post. Thank you anyways
                – user587054
                yesterday


















              • Thank you but can you please help me with the second part I updated on the post. Thank you anyways
                – user587054
                yesterday
















              Thank you but can you please help me with the second part I updated on the post. Thank you anyways
              – user587054
              yesterday




              Thank you but can you please help me with the second part I updated on the post. Thank you anyways
              – user587054
              yesterday











              0














              A hint for the second part. Consider the possibilities for $n pmod3$, that is, $n$ may be of the form $3k$, $3k+1$ or $3k+2$. Do any of these $n$ yield expressions for $2(n^2+1)-n$ that are possible squares $pmod3$? And if any is, is it also a possible square $pmod9$?






              share|cite|improve this answer


























                0














                A hint for the second part. Consider the possibilities for $n pmod3$, that is, $n$ may be of the form $3k$, $3k+1$ or $3k+2$. Do any of these $n$ yield expressions for $2(n^2+1)-n$ that are possible squares $pmod3$? And if any is, is it also a possible square $pmod9$?






                share|cite|improve this answer
























                  0












                  0








                  0






                  A hint for the second part. Consider the possibilities for $n pmod3$, that is, $n$ may be of the form $3k$, $3k+1$ or $3k+2$. Do any of these $n$ yield expressions for $2(n^2+1)-n$ that are possible squares $pmod3$? And if any is, is it also a possible square $pmod9$?






                  share|cite|improve this answer












                  A hint for the second part. Consider the possibilities for $n pmod3$, that is, $n$ may be of the form $3k$, $3k+1$ or $3k+2$. Do any of these $n$ yield expressions for $2(n^2+1)-n$ that are possible squares $pmod3$? And if any is, is it also a possible square $pmod9$?







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered yesterday









                  Adam Bailey

                  1,9221318




                  1,9221318






























                      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.





                      Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                      Please pay close attention to the following guidance:


                      • 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.


                      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%2f3062483%2fprove-that-for-all-positive-integers-n1-n21-n-is-not-a-perfect-square%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

                      Mario Kart Wii

                      The Binding of Isaac: Rebirth/Afterbirth

                      What does “Dominus providebit” mean?