le roots except for p=3, since
>
> sage: f.discriminant().prime_factors()
> [3]
>
> John
>
> 2009/5/31 wkehowski :
>
>
>
> > Here is the full error message:
>
> > ## BEGIN ERROR MSG
> > sage: load "myroots.sage"
> > -
1), (2, 1)]
>
> If this doesn't work for you, can you give more details (which version
> of Sage are you using, are you working in the command line or the
> notebook).
>
> Best,
> Alex
>
> On Sun, May 31, 2009 at 4:21 PM, wkehowski wrote:
>
> > Thanks, but he
Thanks, but here is the error message:
TypeError: polynomial must be over a field of characteristic 0.
On May 30, 11:09 pm, Alex Ghitza wrote:
> Hi,
>
>
>
> On Sun, May 31, 2009 at 3:34 PM, wkehowski wrote:
>
> > Hello,
>
> > I would like to take a create a
Hello,
I would like to take a create a function that takes a polynomial over
the integers and returns its roots in ZZ mod p for p a prime. I want
to assume the polynomial is globally defined but the prime is the
argument.
Here is what I have in mind but can't quite get the types right.
x = var(
Yes, that is exactly what I wanted! Thanks!
On May 18, 9:22 pm, Jason Grout wrote:
> Minh Nguyen wrote:
> > Hi,
>
> > On Tue, May 19, 2009 at 3:35 AM, wkehowski wrote:
> >> Hello,
>
> >> How would one find the list of variables in a monomial?
>
>
What about matrix rings over ZZ?
On May 18, 7:03 pm, John H Palmieri wrote:
> On May 18, 2:44 pm, benjamin antieau wrote:
>
>
>
> > Oh, and this is also the case over other base rings, like over GF(p).
>
> > On May 18, 2:43 pm, benjamin antieau wrote:
>
> > > I noticed the following incorrect
Hello,
How would one find the list of variables in a monomial?
For example,
(p^2 * q^3).exponents()
returns
[(2,3)]
(without using a ring).
Is there a command that will return something like [(p,q)] or [(p,2),
(q,3)]?
--~--~-~--~~~---~--~~
To post to this gr
