N mod 2 = 1
N mod 3 = 2
N mod 4 = 3
N mod 5 =4
N mod 6 =5
N mod 7 =0
Using Chinese Remainder Theorem plus Modular Multiplicative Inverse which are incorporated in this short computer code, we get the following:
i=0;j=0;m=0;t=0;a=(2, 3, 4, 5, 6, 7);r= (1, 2, 3, 4, 5, 0);c=lcm(a); d=c / a[i];n=d % a[i] ;loop1:m++; if(n*m % a[i] ==1, goto loop, goto loop1);loop:s=(c/a[i]*r[j]*m);i++;j++;t=t+s;m=0;if(i< count a, goto4,m=m);printc,"m + ",t % c;return
OUTPUT =420n + 119, where n =0, 1, 2, 3........etc.
Therefore, the smallest number of eggs he had was = 119 eggs.