Peter Ulrich Kruppa wrote:
>>The second problem is that what I actually need to do is find the square
>>root of a mod n, where n is 20490901. Any tips on how to do that would
>>be appreciated..
>>
>>
>The Maxima statement for m mod n is:
>mod(m,n);
>
>If you need to know more about these things, type
>describe(bfoat);
>to see the online help.
>
>
Well, I have the modulus set to n, but will taking the square (which, as
you said, may be irrational) and then doing mod(whatever) give the right
answer? I wouldn't think it would...
--
William Springer
University of Colorado at Denver
Cogito cogito, ergo cogito sum.