Find the smallest positive integer solution to the following system of congruences: x -= 1(mod5) x -= 10(mod11)

Ernstfalld

Ernstfalld

Answered question

2021-02-10

Find the smallest positive integer solution to the following system of congruences:
x1(mod5)
x10(mod11)

Answer & Explanation

Nichole Watt

Nichole Watt

Skilled2021-02-11Added 100 answers

Step 1 
Given that the congruence system is
x1(mod5) 
x10(mod11) 
The congruence x1(mod5) means if x is divided by 6 the remainder is 1. 
So number x is one of the numbers in the list: 
6,11,16,21,26,31,33,41,... 
Step 2 
Similarity, the congruence x10(mod11) means if x is divided by 11 the remainder is 10. 
Thus, one of the numbers in the list is x: 
21,32,43,54,65,76,87,98,... 
The smallest number that is found in both the list is 21. 
Hence, the solution to the given system of congruence is 21.

Do you have a similar question?

Recalculate according to your conditions!

New Questions in High school geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?