What is the Remainder of Dividing 2(562009)-3?

bphysics
Messages
33
Reaction score
0

Homework Statement



Find the remainder of dividing 2(562009)-3.

Homework Equations



Let m be a positive integer. If a\equivb (mod m) and c\equivd (mod m), then a + c \equiv b + d (mod m) and ac\equivbd (mod m).

The Attempt at a Solution



Using ac\equivbd (mod m):

(2 mod 55)(562009mod 55) - (3 mod 55)

Using a + c \equiv b + d (mod m)

(2 mod 55)((552009 mod 55) + (12009 mod 55)) - (3 mod 55)

(2)(0+1)-(3) = -1 OR remainder of 54

This was a problem on my math test and I got 52 as the remainder at first, but it was wrong.

Thx if you can help me.
 
Physics news on Phys.org
54 is right, 52 is wrong. But your method is dubious. It looks like you are trying use a rule like (a+b)^n mod m=(a^n mod m)+(b^n mod m). That's not right. What is true is that a^n mod m=(a mod m)^n. Just use that 56 mod 55=1.
 
Thanks so much =D, i'll remember that.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top