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-04-10 03:40:02 +0200 | received badge | ● Taxonomist |
| 2018-07-10 17:29:46 +0200 | received badge | ● Famous Question (source) |
| 2017-02-23 23:13:55 +0200 | received badge | ● Notable Question (source) |
| 2015-06-09 18:11:55 +0200 | received badge | ● Popular Question (source) |
| 2013-06-03 12:36:40 +0200 | received badge | ● Student (source) |
| 2013-06-02 22:25:51 +0200 | received badge | ● Editor (source) |
| 2013-06-02 21:37:25 +0200 | asked a question | Polynomial division mod n Hi everyone, Let's suppose that we are working with polynomials modulo n a composite number, for which we know the factorization (n=p*q). If we know that f(x) can be divided by e.g. g(x), what is the most efficient way to calculate f(x)/g(x) in Z_n with Sage? Thanks for your time |
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.