2014-09-03 9:35 UTC+01:00, Jeroen Demeyer <[email protected]>: > On 2014-09-03 09:46, Vincent Delecroix wrote: >> Nope. As you see from the code it does not call `is_prime_power` but >> the fact that the factorization has length one... the error is right ! >> There is no way to guess what is your prime if you feed the big O with >> 1... (Python first evaluates 7^0 of course). > Minor remark: in PARI this works because PARI has special parsing rules > for "O(p^n)", it does not evaluate p^n.
Would it be hard to make it work in Sage? Similarly for GF(p^n). It is just stupid to compute p^n and then factorize it! Vincent -- You received this message because you are subscribed to the Google Groups "sage-nt" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send an email to [email protected]. Visit this group at http://groups.google.com/group/sage-nt. For more options, visit https://groups.google.com/d/optout.
