Solving Fractional Diophantine EquationsQuadratic fields and solving Diophantine equationsSolving a system of Diophantine equationsSolving linear Diophantine equations in 3 variablesSolving quadratic diophantine equations in two variablesSolving two diophantine equations.Solving diophantine equationssolving a Diophantine system of two equationsTechniques for solving Diophantine equations.Approximating a decimal with a fraction (32-bit fixed point to two 23-bit numbers). Think binary, ease of computation.Solving diophantine equations: Finding integer solutions

Example of a continuous function that don't have a continuous extension

What defenses are there against being summoned by the Gate spell?

How does one intimidate enemies without having the capacity for violence?

Why don't electron-positron collisions release infinite energy?

How could an uplifted falcon's brain work?

Why did the Germans forbid the possession of pet pigeons in Rostov-on-Don in 1941?

Can I make popcorn with any corn?

Why doesn't Newton's third law mean a person bounces back to where they started when they hit the ground?

Why, historically, did Gödel think CH was false?

Can divisibility rules for digits be generalized to sum of digits

Test whether all array elements are factors of a number

How to test if a transaction is standard without spending real money?

The use of multiple foreign keys on same column in SQL Server

can i play a electric guitar through a bass amp?

A newer friend of my brother's gave him a load of baseball cards that are supposedly extremely valuable. Is this a scam?

Why can't I see bouncing of a switch on an oscilloscope?

"You are your self first supporter", a more proper way to say it

Is it legal for company to use my work email to pretend I still work there?

Modeling an IPv4 Address

Theorems that impeded progress

Can I ask the recruiters in my resume to put the reason why I am rejected?

What are these boxed doors outside store fronts in New York?

Approximately how much travel time was saved by the opening of the Suez Canal in 1869?

How old can references or sources in a thesis be?



Solving Fractional Diophantine Equations


Quadratic fields and solving Diophantine equationsSolving a system of Diophantine equationsSolving linear Diophantine equations in 3 variablesSolving quadratic diophantine equations in two variablesSolving two diophantine equations.Solving diophantine equationssolving a Diophantine system of two equationsTechniques for solving Diophantine equations.Approximating a decimal with a fraction (32-bit fixed point to two 23-bit numbers). Think binary, ease of computation.Solving diophantine equations: Finding integer solutions













1












$begingroup$


As my search to create an efficient factorization algorithm continues, I stumbled upon this equation for one of my test cases:$$dfrac3-n^22n-12=k$$ To continue, I need to know what integer values of $n$ make $k$ an integer. Since I want this to be a factorization algorithm, I would like methods that don't include factoring; and since I want this to be efficient, I would like methods that doesn't include checking between a range. Other than those two exceptions, any method is accepted, no matter how complicated (I can always optimize it later).










share|cite|improve this question









$endgroup$
















    1












    $begingroup$


    As my search to create an efficient factorization algorithm continues, I stumbled upon this equation for one of my test cases:$$dfrac3-n^22n-12=k$$ To continue, I need to know what integer values of $n$ make $k$ an integer. Since I want this to be a factorization algorithm, I would like methods that don't include factoring; and since I want this to be efficient, I would like methods that doesn't include checking between a range. Other than those two exceptions, any method is accepted, no matter how complicated (I can always optimize it later).










    share|cite|improve this question









    $endgroup$














      1












      1








      1


      1



      $begingroup$


      As my search to create an efficient factorization algorithm continues, I stumbled upon this equation for one of my test cases:$$dfrac3-n^22n-12=k$$ To continue, I need to know what integer values of $n$ make $k$ an integer. Since I want this to be a factorization algorithm, I would like methods that don't include factoring; and since I want this to be efficient, I would like methods that doesn't include checking between a range. Other than those two exceptions, any method is accepted, no matter how complicated (I can always optimize it later).










      share|cite|improve this question









      $endgroup$




      As my search to create an efficient factorization algorithm continues, I stumbled upon this equation for one of my test cases:$$dfrac3-n^22n-12=k$$ To continue, I need to know what integer values of $n$ make $k$ an integer. Since I want this to be a factorization algorithm, I would like methods that don't include factoring; and since I want this to be efficient, I would like methods that doesn't include checking between a range. Other than those two exceptions, any method is accepted, no matter how complicated (I can always optimize it later).







      calculus algebra-precalculus diophantine-equations fractions






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 29 at 16:44









      Quote DaveQuote Dave

      194




      194




















          1 Answer
          1






          active

          oldest

          votes


















          3












          $begingroup$

          Hint: If $A=frac3-n^22n-12$ has to be an integer, so does $2cdot A$
          $$=frac-2n^2+62n-12=-n-frac3-6nn-6=-n-frac-6(n-6)-33n-6=-(n+6)-frac33n-6$$ and hence, you're looking for values of $n$, for which




          $$frac33n-6inmathbb Z$$







          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Yes but that would require a. Factorization, or b. Checking over a range, both of which I would not like. Are there any other methods?
            $endgroup$
            – Quote Dave
            Mar 29 at 18:10











          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%2f3167340%2fsolving-fractional-diophantine-equations%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          3












          $begingroup$

          Hint: If $A=frac3-n^22n-12$ has to be an integer, so does $2cdot A$
          $$=frac-2n^2+62n-12=-n-frac3-6nn-6=-n-frac-6(n-6)-33n-6=-(n+6)-frac33n-6$$ and hence, you're looking for values of $n$, for which




          $$frac33n-6inmathbb Z$$







          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Yes but that would require a. Factorization, or b. Checking over a range, both of which I would not like. Are there any other methods?
            $endgroup$
            – Quote Dave
            Mar 29 at 18:10















          3












          $begingroup$

          Hint: If $A=frac3-n^22n-12$ has to be an integer, so does $2cdot A$
          $$=frac-2n^2+62n-12=-n-frac3-6nn-6=-n-frac-6(n-6)-33n-6=-(n+6)-frac33n-6$$ and hence, you're looking for values of $n$, for which




          $$frac33n-6inmathbb Z$$







          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Yes but that would require a. Factorization, or b. Checking over a range, both of which I would not like. Are there any other methods?
            $endgroup$
            – Quote Dave
            Mar 29 at 18:10













          3












          3








          3





          $begingroup$

          Hint: If $A=frac3-n^22n-12$ has to be an integer, so does $2cdot A$
          $$=frac-2n^2+62n-12=-n-frac3-6nn-6=-n-frac-6(n-6)-33n-6=-(n+6)-frac33n-6$$ and hence, you're looking for values of $n$, for which




          $$frac33n-6inmathbb Z$$







          share|cite|improve this answer











          $endgroup$



          Hint: If $A=frac3-n^22n-12$ has to be an integer, so does $2cdot A$
          $$=frac-2n^2+62n-12=-n-frac3-6nn-6=-n-frac-6(n-6)-33n-6=-(n+6)-frac33n-6$$ and hence, you're looking for values of $n$, for which




          $$frac33n-6inmathbb Z$$








          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Mar 29 at 17:54

























          answered Mar 29 at 17:39









          Dr. MathvaDr. Mathva

          3,313630




          3,313630











          • $begingroup$
            Yes but that would require a. Factorization, or b. Checking over a range, both of which I would not like. Are there any other methods?
            $endgroup$
            – Quote Dave
            Mar 29 at 18:10
















          • $begingroup$
            Yes but that would require a. Factorization, or b. Checking over a range, both of which I would not like. Are there any other methods?
            $endgroup$
            – Quote Dave
            Mar 29 at 18:10















          $begingroup$
          Yes but that would require a. Factorization, or b. Checking over a range, both of which I would not like. Are there any other methods?
          $endgroup$
          – Quote Dave
          Mar 29 at 18:10




          $begingroup$
          Yes but that would require a. Factorization, or b. Checking over a range, both of which I would not like. Are there any other methods?
          $endgroup$
          – Quote Dave
          Mar 29 at 18:10

















          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%2f3167340%2fsolving-fractional-diophantine-equations%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

          Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

          Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

          Boston (Lincolnshire) Stedsbyld | Berne yn Boston | NavigaasjemenuBoston Borough CouncilBoston, Lincolnshire