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.
| 2018-12-30 13:33:55 +0200 | received badge | ● Famous Question (source) |
| 2018-01-17 15:45:19 +0200 | received badge | ● Taxonomist |
| 2017-09-29 00:36:12 +0200 | received badge | ● Popular Question (source) |
| 2017-09-29 00:36:12 +0200 | received badge | ● Notable Question (source) |
| 2016-08-10 23:46:38 +0200 | received badge | ● Popular Question (source) |
| 2016-08-10 23:46:38 +0200 | received badge | ● Notable Question (source) |
| 2012-01-24 13:56:58 +0200 | asked a question | How do I compute modular polynomials? How do I compute modular polynomials in SAGE? More precisely $\phi_{\ell}(X,Y) \pmod{p}$ where $p$ is a prime. |
| 2012-01-24 13:52:48 +0200 | asked a question | modular polynomials How do I compute modular polynomials? |
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.