and .
Thus . Now express in binary..
I was wondering if somebody could help me with a problem I am having. I am trying to compute:
9983^2052765 mod 36581 and 13461^2052765 mod 36581
I am pretty sure it can be accomplished with the square and multiply method but I'm not to sure as to how to accomplish this. Could anyone point me in the right direction or get me started off?
i.e.
Let , now .
If we compute starting from to , it will be less messy to compute the solution.
This seems rather tedious. If you are familiar with the notion of multiplicative order, this can be a bit easier. Are you?
If so, use the fact that and . Then you'll only have to do the above for instead of
Okay, so this is what I did.
377 = 101111001
377^256 % 36581 = 25398
377^64 % 36581 = 13118
377^32 % 36581 = 20272
377^16 % 36581 = 24932
377^8 % 36581 = 26097
377^1 % 36581 = 377
multiplied those all together and got 1656734045363396234936064.
Now do i mod that number by 36581 for the answer?