how does sage factor a Mersenne number?
E.g. 2^67-1. Does it simply have/use a lookup-table for Mersennes?
E.g. 2^67-1. Does it simply have/use a lookup-table for Mersennes?
By default, Sage delegates integer factorization to PARI, so you should have a look to their documentation and source code to know the details of the algorithm they use. It seems not to look at any table, since if you look to close numbers (e.g. 2^67-5), you will notice similar timings.
Please start posting anonymously - your entry will be published after you log in or create a new account.
Asked: 2016-09-05 21:25:32 +0100
Seen: 406 times
Last updated: Sep 05 '16
Is there an example of how i could write a polynomial as a product of linear factors
Factoring polynomials over IntegerModRings
Polynomial: distribute to greatest common factor
Polynomial arithmetic modulo prime powers
Powers of irreducible polynomials
Factoring expression involving exponentials