Testwiki:Reference desk/Archives/Mathematics/2017 July 26
From testwiki
Revision as of 03:06, 2 August 2017 by imported>Scsbot (edited by robot: archiving July 26)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Template:Error:not substituted
{| width = "100%"
|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < July 25 ! width="25%" align="center"|<< Jun | July | Aug >> ! width="20%" align="right" |Current desk > |}
| Welcome to the Wikipedia Mathematics Reference Desk Archives |
|---|
| The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
Contents
July 26
Diophantine Equation
Let a be some natural number. What are the solutions in integers of the equation ? עברית (talk) 16:32, 26 July 2017 (UTC)
- Any even difference of 2 squares is divisible by 4, so there are many solutions to that equation! Georgia guy (talk) 16:38, 26 July 2017 (UTC)
- Template:Em: Try rewriting as , and then factor and solve in terms of the factors of 4a. Considering whether the factors are even or odd should let you simplify further. --Deacon Vorbis (talk) 16:47, 26 July 2017 (UTC)
- Template:Ec Some random thoughts:
- Consider a prime number p≠2 that divides both x and y, then p² must divide a since it divides 4a and not 4, and then (x/p, y/p) is solution for a/p². Hence, the general solution should be easily generated from the solutions where by stripping a from its square divisors.
- For the divisibility by 2: Obviously x and y are both odd or both even. If they are even, the equation reduces to where . If they are odd, which reduces to . Both equations look quite attackable by looking at the pairs m,n such that a=m*n, and retrieving x,y as a function of m,n. TigraanClick here to contact me 17:24, 26 July 2017 (UTC)