Sunday

April 20, 2014

April 20, 2014

Posted by **john** on Wednesday, August 1, 2012 at 9:20pm.

- number theory -
**Count Iblis**, Wednesday, August 1, 2012 at 9:44pmHint: Chinese Remainder Theorem

- number theory -
**MathMate**, Wednesday, August 1, 2012 at 9:49pmYou can try the CRT (Chinese remainder theorem).

Master sun proceeded as follows:

Given

N≡3 mod 7

N≡4 mod 9

N≡8 mod 11

We need to find the smallest positive N.

First we find the unit remainders,

99≡1 mod 7 (99 is product of 9*11_

154≡1 mod 9 (154 is multiple of 7*11)

441≡1 mod 11 (441 is multiple of 7*9)

N mod(7*9*11) is the required number such that

N=3*99+4*154+8*441 mod 693

=4441 mod 693

=283

Check:

283≡3 mod 7

283≡4 mod 9

283≡8 mod 11 Yeah!

**Related Questions**

MATH - Find the only positive integer whose cube is the sum of the cubes of ...

Math - Find the least positive integer that leaves the remainder 3 when divided...

heeeeeeelp math3 - For every positive integer n consider all polynomials f(x) ...

heeeeeeeeelp math - For every positive integer n consider all polynomials f(x) ...

heeeeeelp math - For every positive integer n, consider all polynomials f(x) ...

heeeeeeelp math - For every positive integer n, consider all monic polynomials f...

Math (algebra) - For every positive integer n, consider all monic polynomials f(...

Math (Complex Numbers) - Let N be the sum of all prime powers that can be ...

algebra - Find two consecutive positive integers such that the sum of their ...

mathematics - It can be shown that for any positive integer n, the infinitely ...