Is it possible to find $x$ in a general form or forms for the equation $2n^2 + 2n + 1$ mod $x = 0$?












0












$begingroup$


Hello I was wondering is possible to find x in a general form or forms so that there are integer answers for something like the equation below? If so could you point me in the right direction?



$2n^2 + 2n + 1$ mod$ x = 0$



ie



$x = 1,5,13,17$... work and solve the condition.






elementary-number-theory modular-arithmetic







share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    Hello I was wondering is possible to find x in a general form or forms so that there are integer answers for something like the equation below? If so could you point me in the right direction?



    $2n^2 + 2n + 1$ mod$ x = 0$



    ie



    $x = 1,5,13,17$... work and solve the condition.






    elementary-number-theory modular-arithmetic







    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      Hello I was wondering is possible to find x in a general form or forms so that there are integer answers for something like the equation below? If so could you point me in the right direction?



      $2n^2 + 2n + 1$ mod$ x = 0$



      ie



      $x = 1,5,13,17$... work and solve the condition.






      elementary-number-theory modular-arithmetic







      share|cite|improve this question











      $endgroup$




      Hello I was wondering is possible to find x in a general form or forms so that there are integer answers for something like the equation below? If so could you point me in the right direction?



      $2n^2 + 2n + 1$ mod$ x = 0$



      ie



      $x = 1,5,13,17$... work and solve the condition.






      elementary-number-theory modular-arithmetic




      elementary-number-theory modular-arithmetic






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 22 '18 at 5:58









      AandJ4Ever

      114




      114










      asked Dec 22 '18 at 5:30









      Ryan ToppsRyan Topps

      124




      124






















          2 Answers
          2






          active

          oldest

          votes


















          3












          $begingroup$

          I think you're asking for what $x$ the equation $2n^2 + 2n + 1$ has a root modulo $x$.



          First, since $2n^2 + 2n + 1$ is odd, we can assume that $x$ is odd. Then we can write:



          $$2n^2 + 2n + 1 = frac{1}{2}((2n+1)^2 + 1)$$



          This allows us to see that the equation has a solution if and only if there is a square root of $-1$ modulo $x$.



          By the Chinese Remainder Theorem, this holds exactly when there is a square root of $-1$ modulo $p^k$ for every prime power $p^k$ dividing $x$.



          It's a standard result that this happens when $pequiv 1pmod{4}$. This can be seen by looking at the cyclic group of units $pmod{p^k}$ and seeing when it has order divisible by $4$.



          In conclusion, your equation has a solution exactly when all of the prime factors of $x$ are $1pmod 4$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you, you explained that well
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 7:36










          • $begingroup$
            @RyanTopps I made a mistake; see the updated answer. The prime factors can never be $3pmod{4}$, I was misremembering something else.
            $endgroup$
            – Slade
            Dec 22 '18 at 7:44



















          0












          $begingroup$

          Yes: $f(n)$ mod $x=0$ if and only if $xmid f(n)$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            17 is not part of f(n) though
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 5:57






          • 1




            $begingroup$
            @RyanTopps We have $amid b$ iff there is some integer $k$ s.t. $b=ak$ iff $b=0$ mod $a$.
            $endgroup$
            – AandJ4Ever
            Dec 22 '18 at 6:01













          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%2f3049140%2fis-it-possible-to-find-x-in-a-general-form-or-forms-for-the-equation-2n2-2%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          2 Answers
          2






          active

          oldest

          votes








          2 Answers
          2






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          3












          $begingroup$

          I think you're asking for what $x$ the equation $2n^2 + 2n + 1$ has a root modulo $x$.



          First, since $2n^2 + 2n + 1$ is odd, we can assume that $x$ is odd. Then we can write:



          $$2n^2 + 2n + 1 = frac{1}{2}((2n+1)^2 + 1)$$



          This allows us to see that the equation has a solution if and only if there is a square root of $-1$ modulo $x$.



          By the Chinese Remainder Theorem, this holds exactly when there is a square root of $-1$ modulo $p^k$ for every prime power $p^k$ dividing $x$.



          It's a standard result that this happens when $pequiv 1pmod{4}$. This can be seen by looking at the cyclic group of units $pmod{p^k}$ and seeing when it has order divisible by $4$.



          In conclusion, your equation has a solution exactly when all of the prime factors of $x$ are $1pmod 4$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you, you explained that well
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 7:36










          • $begingroup$
            @RyanTopps I made a mistake; see the updated answer. The prime factors can never be $3pmod{4}$, I was misremembering something else.
            $endgroup$
            – Slade
            Dec 22 '18 at 7:44
















          3












          $begingroup$

          I think you're asking for what $x$ the equation $2n^2 + 2n + 1$ has a root modulo $x$.



          First, since $2n^2 + 2n + 1$ is odd, we can assume that $x$ is odd. Then we can write:



          $$2n^2 + 2n + 1 = frac{1}{2}((2n+1)^2 + 1)$$



          This allows us to see that the equation has a solution if and only if there is a square root of $-1$ modulo $x$.



          By the Chinese Remainder Theorem, this holds exactly when there is a square root of $-1$ modulo $p^k$ for every prime power $p^k$ dividing $x$.



          It's a standard result that this happens when $pequiv 1pmod{4}$. This can be seen by looking at the cyclic group of units $pmod{p^k}$ and seeing when it has order divisible by $4$.



          In conclusion, your equation has a solution exactly when all of the prime factors of $x$ are $1pmod 4$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you, you explained that well
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 7:36










          • $begingroup$
            @RyanTopps I made a mistake; see the updated answer. The prime factors can never be $3pmod{4}$, I was misremembering something else.
            $endgroup$
            – Slade
            Dec 22 '18 at 7:44














          3












          3








          3





          $begingroup$

          I think you're asking for what $x$ the equation $2n^2 + 2n + 1$ has a root modulo $x$.



          First, since $2n^2 + 2n + 1$ is odd, we can assume that $x$ is odd. Then we can write:



          $$2n^2 + 2n + 1 = frac{1}{2}((2n+1)^2 + 1)$$



          This allows us to see that the equation has a solution if and only if there is a square root of $-1$ modulo $x$.



          By the Chinese Remainder Theorem, this holds exactly when there is a square root of $-1$ modulo $p^k$ for every prime power $p^k$ dividing $x$.



          It's a standard result that this happens when $pequiv 1pmod{4}$. This can be seen by looking at the cyclic group of units $pmod{p^k}$ and seeing when it has order divisible by $4$.



          In conclusion, your equation has a solution exactly when all of the prime factors of $x$ are $1pmod 4$.






          share|cite|improve this answer











          $endgroup$



          I think you're asking for what $x$ the equation $2n^2 + 2n + 1$ has a root modulo $x$.



          First, since $2n^2 + 2n + 1$ is odd, we can assume that $x$ is odd. Then we can write:



          $$2n^2 + 2n + 1 = frac{1}{2}((2n+1)^2 + 1)$$



          This allows us to see that the equation has a solution if and only if there is a square root of $-1$ modulo $x$.



          By the Chinese Remainder Theorem, this holds exactly when there is a square root of $-1$ modulo $p^k$ for every prime power $p^k$ dividing $x$.



          It's a standard result that this happens when $pequiv 1pmod{4}$. This can be seen by looking at the cyclic group of units $pmod{p^k}$ and seeing when it has order divisible by $4$.



          In conclusion, your equation has a solution exactly when all of the prime factors of $x$ are $1pmod 4$.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 22 '18 at 7:43

























          answered Dec 22 '18 at 7:07









          SladeSlade

          25.1k12665




          25.1k12665












          • $begingroup$
            Thank you, you explained that well
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 7:36










          • $begingroup$
            @RyanTopps I made a mistake; see the updated answer. The prime factors can never be $3pmod{4}$, I was misremembering something else.
            $endgroup$
            – Slade
            Dec 22 '18 at 7:44


















          • $begingroup$
            Thank you, you explained that well
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 7:36










          • $begingroup$
            @RyanTopps I made a mistake; see the updated answer. The prime factors can never be $3pmod{4}$, I was misremembering something else.
            $endgroup$
            – Slade
            Dec 22 '18 at 7:44
















          $begingroup$
          Thank you, you explained that well
          $endgroup$
          – Ryan Topps
          Dec 22 '18 at 7:36




          $begingroup$
          Thank you, you explained that well
          $endgroup$
          – Ryan Topps
          Dec 22 '18 at 7:36












          $begingroup$
          @RyanTopps I made a mistake; see the updated answer. The prime factors can never be $3pmod{4}$, I was misremembering something else.
          $endgroup$
          – Slade
          Dec 22 '18 at 7:44




          $begingroup$
          @RyanTopps I made a mistake; see the updated answer. The prime factors can never be $3pmod{4}$, I was misremembering something else.
          $endgroup$
          – Slade
          Dec 22 '18 at 7:44











          0












          $begingroup$

          Yes: $f(n)$ mod $x=0$ if and only if $xmid f(n)$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            17 is not part of f(n) though
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 5:57






          • 1




            $begingroup$
            @RyanTopps We have $amid b$ iff there is some integer $k$ s.t. $b=ak$ iff $b=0$ mod $a$.
            $endgroup$
            – AandJ4Ever
            Dec 22 '18 at 6:01


















          0












          $begingroup$

          Yes: $f(n)$ mod $x=0$ if and only if $xmid f(n)$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            17 is not part of f(n) though
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 5:57






          • 1




            $begingroup$
            @RyanTopps We have $amid b$ iff there is some integer $k$ s.t. $b=ak$ iff $b=0$ mod $a$.
            $endgroup$
            – AandJ4Ever
            Dec 22 '18 at 6:01
















          0












          0








          0





          $begingroup$

          Yes: $f(n)$ mod $x=0$ if and only if $xmid f(n)$.






          share|cite|improve this answer









          $endgroup$



          Yes: $f(n)$ mod $x=0$ if and only if $xmid f(n)$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 22 '18 at 5:54









          AandJ4EverAandJ4Ever

          114




          114












          • $begingroup$
            17 is not part of f(n) though
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 5:57






          • 1




            $begingroup$
            @RyanTopps We have $amid b$ iff there is some integer $k$ s.t. $b=ak$ iff $b=0$ mod $a$.
            $endgroup$
            – AandJ4Ever
            Dec 22 '18 at 6:01




















          • $begingroup$
            17 is not part of f(n) though
            $endgroup$
            – Ryan Topps
            Dec 22 '18 at 5:57






          • 1




            $begingroup$
            @RyanTopps We have $amid b$ iff there is some integer $k$ s.t. $b=ak$ iff $b=0$ mod $a$.
            $endgroup$
            – AandJ4Ever
            Dec 22 '18 at 6:01


















          $begingroup$
          17 is not part of f(n) though
          $endgroup$
          – Ryan Topps
          Dec 22 '18 at 5:57




          $begingroup$
          17 is not part of f(n) though
          $endgroup$
          – Ryan Topps
          Dec 22 '18 at 5:57




          1




          1




          $begingroup$
          @RyanTopps We have $amid b$ iff there is some integer $k$ s.t. $b=ak$ iff $b=0$ mod $a$.
          $endgroup$
          – AandJ4Ever
          Dec 22 '18 at 6:01






          $begingroup$
          @RyanTopps We have $amid b$ iff there is some integer $k$ s.t. $b=ak$ iff $b=0$ mod $a$.
          $endgroup$
          – AandJ4Ever
          Dec 22 '18 at 6:01




















          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%2f3049140%2fis-it-possible-to-find-x-in-a-general-form-or-forms-for-the-equation-2n2-2%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

          Ellipse (mathématiques)

          Image
          Pour les articles homonymes, voir Ellipse. L'ellipse est le lieu des points dont la somme des distances à deux points fixes, dits foyers, est constante. Section du cône ou projection du cercle. En géométrie, une ellipse est une courbe plane fermée obtenue par l’intersection d’un cône de révolution avec un plan, à condition que celui-ci coupe l'axe de rotation du cône ou du cylindre : c'est une conique d'excentricité strictement comprise entre 0 et 1. On peut également la définir comme le lieu des points dont la somme des distances à deux points fixes, dits foyers, est constante (sa construction par la méthode du jardinier est très simple). Dans la vie courante, l’ellipse est la forme qu'on perçoit en regardant un cercle en perspective, ou la figure formée par l’ombre d'un disque sur une surface plane. On retrouve aussi, en première approximation [ 1 ] , des ellipses dans les trajectoires des corps célestes (planètes, comètes ou satellites arti...
          Read more

          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

          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