For which integer $n$ is $28 + 101 + 2^n$ a perfect square?












2












$begingroup$


This question



For which integer $n$ is $$28 + 101 + 2^n$$ a perfect square. Please also suggest an algorithm to solve similar problems. Thanks



Btw, this question has been taken from an Aryabhatta exam for 8th graders in India.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Try $$n=12$$ to get a square number
    $endgroup$
    – Dr. Sonnhard Graubner
    Jan 31 at 15:09
















2












$begingroup$


This question



For which integer $n$ is $$28 + 101 + 2^n$$ a perfect square. Please also suggest an algorithm to solve similar problems. Thanks



Btw, this question has been taken from an Aryabhatta exam for 8th graders in India.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Try $$n=12$$ to get a square number
    $endgroup$
    – Dr. Sonnhard Graubner
    Jan 31 at 15:09














2












2








2





$begingroup$


This question



For which integer $n$ is $$28 + 101 + 2^n$$ a perfect square. Please also suggest an algorithm to solve similar problems. Thanks



Btw, this question has been taken from an Aryabhatta exam for 8th graders in India.










share|cite|improve this question











$endgroup$




This question



For which integer $n$ is $$28 + 101 + 2^n$$ a perfect square. Please also suggest an algorithm to solve similar problems. Thanks



Btw, this question has been taken from an Aryabhatta exam for 8th graders in India.







elementary-number-theory square-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 31 at 15:50









Maria Mazur

50k1361124




50k1361124










asked Jan 31 at 15:02









Vasu090Vasu090

244




244








  • 1




    $begingroup$
    Try $$n=12$$ to get a square number
    $endgroup$
    – Dr. Sonnhard Graubner
    Jan 31 at 15:09














  • 1




    $begingroup$
    Try $$n=12$$ to get a square number
    $endgroup$
    – Dr. Sonnhard Graubner
    Jan 31 at 15:09








1




1




$begingroup$
Try $$n=12$$ to get a square number
$endgroup$
– Dr. Sonnhard Graubner
Jan 31 at 15:09




$begingroup$
Try $$n=12$$ to get a square number
$endgroup$
– Dr. Sonnhard Graubner
Jan 31 at 15:09










4 Answers
4






active

oldest

votes


















1












$begingroup$

You can move terms around to try to get things to look like a perfect square trinomial:
$(a + b)^2 = a^2 + 2ab + b^2$



Specifically, the special case where $a$ or $b$ is 1:
$(1 + b)^2 = 1 + 2 b + b^2$



Start by combining the constant terms, and notice that 128 is a power of 2:



$28 + 101 + 2^n = 1 + 128 + 2^n = 1 + 2 cdot 2^6 + 2^n$



We can see that $(1 + 2^6)^2 = 1 + 2 cdot 2^6 + (2^6)^2 = 1 + 2 cdot 2^6 + 2^{12}$



I think the squaring binomials/perfect square trinomials is your best general approach.



But given that the question was multiple choice, guess and check would solve this particular problem quickly ;)






share|cite|improve this answer









$endgroup$





















    1












    $begingroup$

    One way is to notice that



    $28+101+2^n=128+1+2^n=2^7+1+2^n=2^n+2*2^6+1$.



    Therefore, if we let $n=12$ we have



    $2^{12}+2*2^6+1=(2^6)^2+2*2^6+1=(2^6+1)^2$



    Which is a perfect square, as desired.
    This relies on noticing this specific pattern, so doesn't lend itself to a general method. One could always guess and check.






    share|cite|improve this answer









    $endgroup$





















      1












      $begingroup$

      Write:$$28 + 101 + 2^n =k^2$$



      For $n$ odd the expresion $$28 + 101 + 2^nequiv 2pmod 3$$ so in this case there is no solution (since $k^2equiv 0,1pmod 3$)



      So $n= 2m$ and we have $$129 = k^2-2^{2m} = (k-2^m)(k+2^m)$$



      Since $k-2^m<k+2^m$ we have only this possibiltes



      $129 = k+2^m$ and $1=k-2^m$ ($m=6$)



      or



      $43 = k+2^m$ and $3=k-2^m$ (no solution)






      share|cite|improve this answer









      $endgroup$





















        0












        $begingroup$

        Let us assume $n=2k$ and $129+2^{2k}=p^2$



        Then we get:



        $$p^2-(2^k)^2=129$$



        $$(p-2^k)(p+2^k)=129=1 times 129=3 times 43 $$



        So we get:



        $$p-2^k=1$$



        $$p+2^k=129$$



        Solving we get



        $$2^k=64$$ $implies$ $k=6$



        hence $$n=12$$



        The other way of resolving will not give you integer solution of $k$






        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%2f3094979%2ffor-which-integer-n-is-28-101-2n-a-perfect-square%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          4 Answers
          4






          active

          oldest

          votes








          4 Answers
          4






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          1












          $begingroup$

          You can move terms around to try to get things to look like a perfect square trinomial:
          $(a + b)^2 = a^2 + 2ab + b^2$



          Specifically, the special case where $a$ or $b$ is 1:
          $(1 + b)^2 = 1 + 2 b + b^2$



          Start by combining the constant terms, and notice that 128 is a power of 2:



          $28 + 101 + 2^n = 1 + 128 + 2^n = 1 + 2 cdot 2^6 + 2^n$



          We can see that $(1 + 2^6)^2 = 1 + 2 cdot 2^6 + (2^6)^2 = 1 + 2 cdot 2^6 + 2^{12}$



          I think the squaring binomials/perfect square trinomials is your best general approach.



          But given that the question was multiple choice, guess and check would solve this particular problem quickly ;)






          share|cite|improve this answer









          $endgroup$


















            1












            $begingroup$

            You can move terms around to try to get things to look like a perfect square trinomial:
            $(a + b)^2 = a^2 + 2ab + b^2$



            Specifically, the special case where $a$ or $b$ is 1:
            $(1 + b)^2 = 1 + 2 b + b^2$



            Start by combining the constant terms, and notice that 128 is a power of 2:



            $28 + 101 + 2^n = 1 + 128 + 2^n = 1 + 2 cdot 2^6 + 2^n$



            We can see that $(1 + 2^6)^2 = 1 + 2 cdot 2^6 + (2^6)^2 = 1 + 2 cdot 2^6 + 2^{12}$



            I think the squaring binomials/perfect square trinomials is your best general approach.



            But given that the question was multiple choice, guess and check would solve this particular problem quickly ;)






            share|cite|improve this answer









            $endgroup$
















              1












              1








              1





              $begingroup$

              You can move terms around to try to get things to look like a perfect square trinomial:
              $(a + b)^2 = a^2 + 2ab + b^2$



              Specifically, the special case where $a$ or $b$ is 1:
              $(1 + b)^2 = 1 + 2 b + b^2$



              Start by combining the constant terms, and notice that 128 is a power of 2:



              $28 + 101 + 2^n = 1 + 128 + 2^n = 1 + 2 cdot 2^6 + 2^n$



              We can see that $(1 + 2^6)^2 = 1 + 2 cdot 2^6 + (2^6)^2 = 1 + 2 cdot 2^6 + 2^{12}$



              I think the squaring binomials/perfect square trinomials is your best general approach.



              But given that the question was multiple choice, guess and check would solve this particular problem quickly ;)






              share|cite|improve this answer









              $endgroup$



              You can move terms around to try to get things to look like a perfect square trinomial:
              $(a + b)^2 = a^2 + 2ab + b^2$



              Specifically, the special case where $a$ or $b$ is 1:
              $(1 + b)^2 = 1 + 2 b + b^2$



              Start by combining the constant terms, and notice that 128 is a power of 2:



              $28 + 101 + 2^n = 1 + 128 + 2^n = 1 + 2 cdot 2^6 + 2^n$



              We can see that $(1 + 2^6)^2 = 1 + 2 cdot 2^6 + (2^6)^2 = 1 + 2 cdot 2^6 + 2^{12}$



              I think the squaring binomials/perfect square trinomials is your best general approach.



              But given that the question was multiple choice, guess and check would solve this particular problem quickly ;)







              share|cite|improve this answer












              share|cite|improve this answer



              share|cite|improve this answer










              answered Jan 31 at 15:10









              Kurt SchwandaKurt Schwanda

              40410




              40410























                  1












                  $begingroup$

                  One way is to notice that



                  $28+101+2^n=128+1+2^n=2^7+1+2^n=2^n+2*2^6+1$.



                  Therefore, if we let $n=12$ we have



                  $2^{12}+2*2^6+1=(2^6)^2+2*2^6+1=(2^6+1)^2$



                  Which is a perfect square, as desired.
                  This relies on noticing this specific pattern, so doesn't lend itself to a general method. One could always guess and check.






                  share|cite|improve this answer









                  $endgroup$


















                    1












                    $begingroup$

                    One way is to notice that



                    $28+101+2^n=128+1+2^n=2^7+1+2^n=2^n+2*2^6+1$.



                    Therefore, if we let $n=12$ we have



                    $2^{12}+2*2^6+1=(2^6)^2+2*2^6+1=(2^6+1)^2$



                    Which is a perfect square, as desired.
                    This relies on noticing this specific pattern, so doesn't lend itself to a general method. One could always guess and check.






                    share|cite|improve this answer









                    $endgroup$
















                      1












                      1








                      1





                      $begingroup$

                      One way is to notice that



                      $28+101+2^n=128+1+2^n=2^7+1+2^n=2^n+2*2^6+1$.



                      Therefore, if we let $n=12$ we have



                      $2^{12}+2*2^6+1=(2^6)^2+2*2^6+1=(2^6+1)^2$



                      Which is a perfect square, as desired.
                      This relies on noticing this specific pattern, so doesn't lend itself to a general method. One could always guess and check.






                      share|cite|improve this answer









                      $endgroup$



                      One way is to notice that



                      $28+101+2^n=128+1+2^n=2^7+1+2^n=2^n+2*2^6+1$.



                      Therefore, if we let $n=12$ we have



                      $2^{12}+2*2^6+1=(2^6)^2+2*2^6+1=(2^6+1)^2$



                      Which is a perfect square, as desired.
                      This relies on noticing this specific pattern, so doesn't lend itself to a general method. One could always guess and check.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Jan 31 at 15:09









                      Josh B.Josh B.

                      2,55511425




                      2,55511425























                          1












                          $begingroup$

                          Write:$$28 + 101 + 2^n =k^2$$



                          For $n$ odd the expresion $$28 + 101 + 2^nequiv 2pmod 3$$ so in this case there is no solution (since $k^2equiv 0,1pmod 3$)



                          So $n= 2m$ and we have $$129 = k^2-2^{2m} = (k-2^m)(k+2^m)$$



                          Since $k-2^m<k+2^m$ we have only this possibiltes



                          $129 = k+2^m$ and $1=k-2^m$ ($m=6$)



                          or



                          $43 = k+2^m$ and $3=k-2^m$ (no solution)






                          share|cite|improve this answer









                          $endgroup$


















                            1












                            $begingroup$

                            Write:$$28 + 101 + 2^n =k^2$$



                            For $n$ odd the expresion $$28 + 101 + 2^nequiv 2pmod 3$$ so in this case there is no solution (since $k^2equiv 0,1pmod 3$)



                            So $n= 2m$ and we have $$129 = k^2-2^{2m} = (k-2^m)(k+2^m)$$



                            Since $k-2^m<k+2^m$ we have only this possibiltes



                            $129 = k+2^m$ and $1=k-2^m$ ($m=6$)



                            or



                            $43 = k+2^m$ and $3=k-2^m$ (no solution)






                            share|cite|improve this answer









                            $endgroup$
















                              1












                              1








                              1





                              $begingroup$

                              Write:$$28 + 101 + 2^n =k^2$$



                              For $n$ odd the expresion $$28 + 101 + 2^nequiv 2pmod 3$$ so in this case there is no solution (since $k^2equiv 0,1pmod 3$)



                              So $n= 2m$ and we have $$129 = k^2-2^{2m} = (k-2^m)(k+2^m)$$



                              Since $k-2^m<k+2^m$ we have only this possibiltes



                              $129 = k+2^m$ and $1=k-2^m$ ($m=6$)



                              or



                              $43 = k+2^m$ and $3=k-2^m$ (no solution)






                              share|cite|improve this answer









                              $endgroup$



                              Write:$$28 + 101 + 2^n =k^2$$



                              For $n$ odd the expresion $$28 + 101 + 2^nequiv 2pmod 3$$ so in this case there is no solution (since $k^2equiv 0,1pmod 3$)



                              So $n= 2m$ and we have $$129 = k^2-2^{2m} = (k-2^m)(k+2^m)$$



                              Since $k-2^m<k+2^m$ we have only this possibiltes



                              $129 = k+2^m$ and $1=k-2^m$ ($m=6$)



                              or



                              $43 = k+2^m$ and $3=k-2^m$ (no solution)







                              share|cite|improve this answer












                              share|cite|improve this answer



                              share|cite|improve this answer










                              answered Jan 31 at 15:15









                              Maria MazurMaria Mazur

                              50k1361124




                              50k1361124























                                  0












                                  $begingroup$

                                  Let us assume $n=2k$ and $129+2^{2k}=p^2$



                                  Then we get:



                                  $$p^2-(2^k)^2=129$$



                                  $$(p-2^k)(p+2^k)=129=1 times 129=3 times 43 $$



                                  So we get:



                                  $$p-2^k=1$$



                                  $$p+2^k=129$$



                                  Solving we get



                                  $$2^k=64$$ $implies$ $k=6$



                                  hence $$n=12$$



                                  The other way of resolving will not give you integer solution of $k$






                                  share|cite|improve this answer









                                  $endgroup$


















                                    0












                                    $begingroup$

                                    Let us assume $n=2k$ and $129+2^{2k}=p^2$



                                    Then we get:



                                    $$p^2-(2^k)^2=129$$



                                    $$(p-2^k)(p+2^k)=129=1 times 129=3 times 43 $$



                                    So we get:



                                    $$p-2^k=1$$



                                    $$p+2^k=129$$



                                    Solving we get



                                    $$2^k=64$$ $implies$ $k=6$



                                    hence $$n=12$$



                                    The other way of resolving will not give you integer solution of $k$






                                    share|cite|improve this answer









                                    $endgroup$
















                                      0












                                      0








                                      0





                                      $begingroup$

                                      Let us assume $n=2k$ and $129+2^{2k}=p^2$



                                      Then we get:



                                      $$p^2-(2^k)^2=129$$



                                      $$(p-2^k)(p+2^k)=129=1 times 129=3 times 43 $$



                                      So we get:



                                      $$p-2^k=1$$



                                      $$p+2^k=129$$



                                      Solving we get



                                      $$2^k=64$$ $implies$ $k=6$



                                      hence $$n=12$$



                                      The other way of resolving will not give you integer solution of $k$






                                      share|cite|improve this answer









                                      $endgroup$



                                      Let us assume $n=2k$ and $129+2^{2k}=p^2$



                                      Then we get:



                                      $$p^2-(2^k)^2=129$$



                                      $$(p-2^k)(p+2^k)=129=1 times 129=3 times 43 $$



                                      So we get:



                                      $$p-2^k=1$$



                                      $$p+2^k=129$$



                                      Solving we get



                                      $$2^k=64$$ $implies$ $k=6$



                                      hence $$n=12$$



                                      The other way of resolving will not give you integer solution of $k$







                                      share|cite|improve this answer












                                      share|cite|improve this answer



                                      share|cite|improve this answer










                                      answered Jan 31 at 15:34









                                      Umesh shankarUmesh shankar

                                      3,09231220




                                      3,09231220






























                                          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%2f3094979%2ffor-which-integer-n-is-28-101-2n-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

                                          MongoDB - Not Authorized To Execute Command

                                          in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith

                                          How to fix TextFormField cause rebuild widget in Flutter