Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2021-01-31 15:05:03 +0200 | received badge | ● Famous Question (source) |
| 2020-09-20 02:20:40 +0200 | received badge | ● Notable Question (source) |
| 2019-04-22 02:28:01 +0200 | received badge | ● Popular Question (source) |
| 2018-01-06 04:06:22 +0200 | received badge | ● Scholar (source) |
| 2018-01-06 04:06:19 +0200 | received badge | ● Supporter (source) |
| 2018-01-06 04:05:14 +0200 | commented question | Routines for Pell's equations Thank you very much @dan_fulea. It seemed to work for higher prime numbers as well - it just took some time. Btw, is there a routine that exists that gives a scalar multiple of a solution (<x,y>? |
| 2017-12-26 22:50:04 +0200 | received badge | ● Student (source) |
| 2017-12-20 09:42:27 +0200 | commented question | Routines for Pell's equations Let's say D = 2 and p = 11, Is there a routine that outputs all the solutions to the equation x^2 - 2y^2 mod 11? Thanks |
| 2017-12-17 21:15:27 +0200 | asked a question | Routines for Pell's equations Hi, I am interested in finding solutions to Pell's equations in finite fields. Are there Sagemath routines that I could use or should I create my own routines? I am interested in finding out solutions to the general equation x^2 - Dy^2 = 1 (mod p). Solutions to this form an closed Abelian group and the points form a cyclic subgroup. Any suggestions/pointers would be deeply appreciated. Thank you, Rahul |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.