Timeline for Paired Quadratic diophantine equations
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 16, 2013 at 16:11 | comment | added | Turbo | Can we have $gcd(a,b)=gcd(c,d)=1$? | |
| Nov 16, 2013 at 16:11 | comment | added | joro | @JAS I edited the answer. There might be smaller solution. Basically $x,y$ do not depend on $t$ at all, for fixed t they can be arbitrary large. | |
| Nov 16, 2013 at 16:10 | vote | accept | Turbo | ||
| Nov 16, 2013 at 16:53 | |||||
| Nov 16, 2013 at 16:09 | history | edited | joro | CC BY-SA 3.0 |
Added explanation
|
| Nov 16, 2013 at 16:05 | vote | accept | Turbo | ||
| Nov 16, 2013 at 16:10 | |||||
| Nov 16, 2013 at 16:04 | comment | added | Turbo | does the minimum number of bits in $x$ and $y$ always grow double exponential($2^{2^t}$) or faster in $t$? Could there be a smaller solution? | |
| Nov 16, 2013 at 16:00 | comment | added | Turbo | does the same trick work for $t=3$? (Asking since mathematica came back empty handed). | |
| Nov 16, 2013 at 15:58 | history | answered | joro | CC BY-SA 3.0 |