There is a group of soldiers.
How many soldiers are there in total at least?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki: Chinese Remainder Theorem
Let the least number of soldiers be n . Then
n ⟹ n 4 a + 1 4 a a ⟹ n 2 0 b + 1 7 6 b + 3 6 b b ⟹ n ≡ 1 (mod 4) ≡ 4 a + 1 ≡ 2 (mod 5) ≡ 1 (mod 5) ≡ 4 ≡ 4 × 5 b + 4 a + 1 = 2 0 b + 1 7 ≡ 4 (mod 7) ≡ 4 (mod 7) ≡ 1 (mod 7) ≡ 6 (mod 7) ≡ 2 0 ( 6 ) + 1 7 = 1 3 7 where a is an integer. where b is an integer.
Thank for the Chinese remainder theorem sir
You are welcome
Problem Loading...
Note Loading...
Set Loading...
If we add three more soldiers, it will become: "there's nothing left in a group of 4,5,7"
So, 4 × 5 × 7 = 1 4 0 satisfies the above. Subtract by 3 and get the answer=137