We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website.
Please click on "Accept cookies" if you agree to the setting of cookies. Cookies that do not require consent remain unaffected by this, see
cookie policy and privacy policy.
DECLINE COOKIES

Find the smallest n that will satisfy the following modular equations:

n mod 1657 =1162, n mod 1162 =453. Any help would be appreciated. Thank you.

Guest Jul 19, 2017

#1**0 **

*editing

We can rewrite the modular equations as:

\(n-1162=1657k,\\ n-453=1162m.\)

Now we are able to remove *n *from the equation:

\(1657k+1162=1162m+453,\)

we can split the first term to tidy things up:

\(1162k+495k+1162-1162m=453\Rightarrow\\ 1162(k+1-m)+495k=453\Rightarrow\\ 1162(k+1-m)+495k-495=453-495\Rightarrow\\ 1162(k+1-m)+495(k-1)=-42.\)

The first term is even and the outcome is even, hence the second term must be even as well. We conclude that 495(*k*-1) is a multiple of 10. In order to get a negative number (*k*+1-*m*) must be negative as well. Since the second term doesn't contribute to the last digit of the sum we know the last digit of the first term must also be 2. As a result (*k*+1-*m*) must have a last digit equal to 1 or 6.

Honga Jul 19, 2017