What, is this a joke?
1) 2220223 = 53 * 163 * 257 , so this isn't a perfect square
2) 20490901 > 2220223 , and a mod n is a itself, so that square root of
a mod n is simply square root of a
3) if you want to perform large calculations modulo n, set madulus to n,
then rat() everything, and after everything's done, call ratdisrep() the
answer to get rid of /R/ form.
For example:
(C10) modulus:2220223$
Warning: MODULUS being set to 2220223, a non-prime.
(C11) rat(sqrt(20490901));
(D11)/R/ SQRT(508894)
(C12) ratdisrep(%);
(D12) SQRT(508894)
(C13) %,float;
(D13) 713.3680676901652
--
Andrei Zorine
William Springer wrote:
> Just started using Maxima, and I'm having a little problem... Well, two
> problems.
>
> The first problem is that when I take SQRT(a), where a is a large
> integer (in this case, 2220223), I just get back SQRT(2220223). Does
> this mean a doesn't have a square root?
>
> 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..
>