When General Han counts the soldiers in his army, he uses the following method. He orders them to line up in rows of 9, then in row of 10, and finally, in rows of 11, and each time he counts the number of soldiers not in a row. One morning, he finds that there are 7 soldiers left when the rest are in groups of 9, 5 soldiers left when the rest are in rows of 10, and 9 soldiers left when the rest are in rows of 11. He knows that there are 1000 soldiers in his army. How many of the soldiers are present this morning?
+876 $n \leq 1000$
$n \equiv 7 \pmod{9}$
$n \equiv 5 \pmod{10}$
$n \equiv 9 \pmod{11}$
By the chinese remainder theorem, you have
$n = 990k + 295$
$n \leq 1000$
$n = \boxed{295}$
