1. ## Diophantine equation

I think Diophantine equations are in Number Theory...

In any event. I am trying to solve $\displaystyle 25 n^2 + (10 a - 264) n - (3a^2 - 4a + 52) - p^2 = 0$ for n and p, where a is a constant positive integer.

I wasn't able to figure out how to do it by hand and I couldn't find a way to get W|A to understand the "a".

Any help is appreciated.

-Dan

2. ## Re: Diophantine equation

If we let $\displaystyle m=25n+(5a-132)$,
the equation can be written as

$\displaystyle (m-5p)(m+5p)=4 \left(4681-355 a+25 a^2\right)$

This says $\displaystyle m-5p$ and $\displaystyle m+5p$ are divisors of $\displaystyle 4 \left(4681-355 a+25 a^2\right)$
Given $\displaystyle a$, we can solve for $\displaystyle m$ and $\displaystyle p$ and then find $\displaystyle n$

This is not the best solution. Ideally we would like to find a formula for $\displaystyle n$ and $\displaystyle p$ in terms of $\displaystyle a$

3. ## Re: Diophantine equation

One explicit solution

$\displaystyle n=-182+14a-a^2$

$\displaystyle p=936-71 a+5 a^2$

4. ## Re: Diophantine equation

I had a thought last night after I posted this. As I was finishing off the typing I noticed that it didn't work if a is to be an integer. Here's the rundown of what I came up with. Maybe someone can fix the details.

My strategy was to complete the square on n, make a redefinition to eliminate n from the LHS. This gives a Pell-like equation.

What I did:
$\displaystyle 25 n^2 + (10 a - 264) n - (3a^2 - 4a + 52) - p^2 = 0$

Completing the square gives:
$\displaystyle \left ( 5n - \frac{10a - 254}{10} \right ) ^2 - p^2 = f(a)$

where $\displaystyle f(a) = 3 a^2 - 4a + 52 + \left ( \frac{10a - 264}{10} \right ) ^2$

Letting $\displaystyle m = \frac{10 a - 264}{10}$ gives a condition on a: m must be an integer. But according to this m is not an integer for any a. So it doesn't work.

-Dan

5. ## Re: Diophantine equation

Originally Posted by topsquark
$\displaystyle 25 n^2 + (10 a - 264) n - (3a^2 - 4a + 52)$
Above has to be a square...(since it equals p^2).
Keeping that in mind in a looper, I get numerous solutions; example:
(a,n,p)
1,15,42
2,10,2
5,-9,62
6,10,18
....
97,47,246

58 solutions keeping a from 1 to 99
and n from -99 to 99.

Did I commit an unforgivable goof?

6. ## Re: Diophantine equation

Originally Posted by DenisB
Above has to be a square...(since it equals p^2).
Keeping that in mind in a looper, I get numerous solutions; example:
(a,n,p)
1,15,42
2,10,2
5,-9,62
6,10,18
....
97,47,246

58 solutions keeping a from 1 to 99
and n from -99 to 99.

Did I commit an unforgivable goof?
Thanks. I was looking for something more analytical, though. Diophantine equations are far from my field of expertise. For all I know maybe it can't be done.

-Dan

7. ## Re: Diophantine equation

If we let $\displaystyle m=25n+(5a-132)$,
the diophantine equation can be rewritten as

$\displaystyle (m-5p)(m+5p)=4 \left(4681-355 a+25 a^2\right)$

Finding solutions involves finding divisors of the quantity

$\displaystyle u=4681-355a+25a^2$ for a given $\displaystyle a$

Look for pairs $\displaystyle \left\{f_1,f_2\right\}$ such that $\displaystyle f_1f_2=u$, $\displaystyle f_2\geq f_1$ and $\displaystyle f_1\equiv 4$ mod 5

Then let $\displaystyle m=f_1+f_2$

example: $\displaystyle a=1$

$\displaystyle \left\{f_1,f_2\right\}=\left\{-4351,-1\right\}$ giving $\displaystyle n=-169$

and

$\displaystyle \left\{f_1,f_2\right\}=\left\{19,229\right\}$ giving $\displaystyle n=15$

8. ## Re: Diophantine equation

Oooooooooooh! That's clever. That answers my question nicely.

Thanks to all!

-Dan
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://mathhelpforum.com/number-theory/278127-diophantine-equation.html", "fetch_time": 1563936368000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2019-30/segments/1563195530250.98/warc/CC-MAIN-20190724020454-20190724042454-00444.warc.gz", "warc_record_offset": 100708851, "warc_record_length": 11985, "token_count": 1188, "char_count": 3604, "score": 4.1875, "int_score": 4, "crawl": "CC-MAIN-2019-30", "snapshot_type": "latest", "language": "en", "language_score": 0.833034873008728, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00025-of-00064.parquet"}