Timeline for Quadratic Diophantine equations solver
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 3, 2022 at 18:42 | answer | added | Rexcirus | timeline score: 0 | |
| Feb 3, 2011 at 11:20 | answer | added | Dr. belisarius | timeline score: 0 | |
| Jun 10, 2010 at 22:21 | history | edited | Wadim Zudilin |
tag added
|
|
| Jun 10, 2010 at 21:52 | comment | added | Will Jagy | note the above are Mathematica commands | |
| Jun 10, 2010 at 21:19 | comment | added | Will Jagy | SquaresR[d, n] gives the number of ways r_d (n) to represent the integer n as a sum of d squares. PowersRepresentations[n, k, p] gives the distinct representations of the integer n as a sum of k non-negative p\^th integer powers. EllipticTheta[a,u,q] gives the theta function Subscript[[CurlyTheta], a](u,q) (a=1,[Ellipsis],4). | |
| Jun 10, 2010 at 21:18 | answer | added | Andreas Rüdinger | timeline score: 2 | |
| Jun 10, 2010 at 21:12 | comment | added | Eric Rowell | For $n=2$ you can try alpertron.com.ar/QUAD.HTM for various values of $x_0$. | |
| Jun 10, 2010 at 21:01 | comment | added | Igor Belegradek | @Will, I wish to distinguish $x_j$ and $-x_j$. Please do not bother to write anything in C++; I just want to know whether there is anything already available as part of Mathematica ot other similar package. @Robin, thanks, reducing factorization is helpful idea. | |
| Jun 10, 2010 at 20:17 | comment | added | Robin Chapman | This is $$(x_0-x_1)(x_0+x_1)=x_0^2-x_1^2=1+x_2^2+\cdots +x_n^2,$$ so sort of reduces to factorization. | |
| Jun 10, 2010 at 20:09 | history | asked | Igor Belegradek | CC BY-SA 2.5 |