# math

how do we find the least residue of
1789 (mod 4), (mod 10), (mod 101)

1. 👍
2. 👎
3. 👁

## Similar Questions

1. ### college math

what is the remainder when the sum 1^5+2^5+3^5+...99^5+100^5 is divided by 4? again a mod problem that I don't know how to work.

2. ### probability

how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)

3. ### solving trig. equations

tan(3x) + 1 = sec(3x) Thanks, pretend 3x equals x so tanx + 1 = secx we know the law that 1 + tanx = secx so tanx + 1 becomes secx and... secx = secx sec(3x) = sec(3x) [just put 3x back in for x- you don't really have to change 3x

4. ### Math

Prove that a^3 ≡ a (mod 3) for every positive integer a. What I did: Assume a^3 ≡ a (mod 3) is true for every positive integer a. Then 3a^3 ≡ 3a (mod 3). (3a^3 - 3a)/3 = k, where k is an integer a^3 - a = k Therefore, a^3

1. ### math

how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)

2. ### number theory

give an example to show that a^2 congruent to b^2 mod n need not imply that a congruent to b mod n.

3. ### Math (Proof)

Prove that if ab = ac (mod n) and a is relatively prime to n, then b = c (mod n). Proof: a and n are relatively prime and from ab = ac(mod n), we have n|(ab-ac), so n|a(b-c). Since (a,n)=1 (relatively prime), we get n(b-c). hence

4. ### Math

Which Statements of congruence are true and which are false and why? 177 _= 17 (mod 8) 871 _= 713 (mod 29) 1322 _= 5294 (mod 12) 5141 _= 8353 (mod 11) 13944 _= 8919 (mod 13) 67 x 73 _= 1 x 3 (mod 5) 17 x 18 x 19 x 20 _= 4! (mod 8)

1. ### math

FIND THE MODULO CLASS TO WHICH THE NUMBER BELONGS FOR THE GIVEN MODULO SYSTEM 53 mod 12

2. ### Math

Which Statements of congruence are true and which are false and why? 177 _= 17 (mod 8) 871 _= 713 (mod 29) 1322 _= 5294 (mod 12) 5141 _= 8353 (mod 11) 13944 _= 8919 (mod 13) 67 x 73 _= 1 x 3 (mod 5) 17 x 18 x 19 x 20 _= 4! (mod 8)

3. ### Maths

Can someone use mod to prove that 10^(3n + 1) cannot be represented as the sum of two cubes. And make it very detailed please.

4. ### collegemath

find remainders when 2^50 and 41^65 are divided by 7. this is a mod problem but I don't know how to work it...