Eggs in a Basket (Remainders) I'm working on a problem:
A woman has a basket of eggs and she drops them all. All she knows is that when she puts them in groups of 2, 3, 4, 5, and 6, there is one left over. When she puts them into groups of 7, there are none left over. What is the minimum number of eggs she could have in her basket?
Here's where I've gotten.
Since all 2, 3, 4, 5, and 6 have a remainder of one, the number must be a multiple of their lcm + 1. So, we know that
$$
 x = 60t + 1.
$$ So, I checked integer values of t and then found their remainder when divided by 7. The solution was when $t = 5,  x = 301$. What I want to know is, is there a 'better' way to do this? And if so, how? I ran into the Chinese Remainder Theorem, but everything I saw didn't make much sense to me.
Thanks!

You have $$x\equiv 1\pmod{60}\\x\equiv 0\pmod{7}$$
Applying Chinese Remainder Theorem is just finding $u,v$ such that $60u+7v=1$. Then the solution is $$x\equiv 1\cdot (7v) + 0\cdot (60 u)=7v\pmod{7\cdot 60}$$
