Math, asked by shahidzahoor667, 6 months ago

. Use Chinese remainder Theorem to solve the following set of congruences
x = 1(mod 3), x = 2(mod 5), x = 3(mod 7)

Answers

Answered by noorsabmujawar

0

Answer:

5555 gfykduguy whisky isha

Previous Question

Next Question

Similar questions

Accountancy, 3 months ago

I am a student of 12th standard, Can i register for CA foundation November 2021 without having admit card/hall ticket?

Social Sciences, 3 months ago

5. नैनीताल नगर राज्य में स्थित है।...

Math, 3 months ago

Find two rational numbers between 5and6...

Math, 6 months ago

Digits:5 4 7 8 1 6 2 9 3 0 Code: R L $ # T @ J F % A 1 Conditions: (i) If the first digit is odd and the last digit is even, the codes for the first and the last digit are to be interchanged. 1 (ii) If the first as well as the last digit is odd, both are to be coded by 'X' (iii) If the first as well as the last digit is even, both are to be coded by' 1 ) 450326 (a) XRA%JX (c) x RA%] (e) None of...

Science, 6 months ago

b. State the scientific and eco-friendlymethods of waste management.

Math, 11 months ago

If 5 years ago, the age of a boy was x years, then his age two years from now will be _______ years.

Science, 11 months ago

types of alloys and constitutions and its uses...

Math, 11 months ago

25% of 16 (15-?)³=256...