Loading [MathJax]/jax/output/SVG/jax.js
 
+0  
 
-1
200
2
avatar+307 

This is  a hard one see if you guys can solve it! Try to!

 

Find the least positive four-digit solution to the following system of congruences.

7x21(mod14)2x+1316(mod9)2x+1x(mod25)

 Dec 4, 2022
 #1
avatar
0

The system reduces to

n = 7 mod 14

n = 6 mod 9

n = 2 mod 25

 

By the Chinese Remainder Theorem, the smallest four-digit number hat works is 2877.

 Dec 4, 2022
 #2
avatar+307 
-2

I don't think 2877 is correct..

 Dec 7, 2022

1 Online Users

avatar