I'm going to write down my problem verbatim:
Write down the integers from $1$ to $50$ in rows of $10$ numbers each. Mark out $1$, and then cross out all multiples of $2$ greater than $2$ (i.e., cross out, $4, 6, 8, . . . ). 3$ is not crossed out, so cross out all multiples of $3$ greater than $3$ (i.e., cross out $6, 9, 12, . . . )$. Find the next number $f$ after $3$ which is not crossed out. This is the next prime. Cross out all non-unary multiples of $f$. Continue in this way until you get to the end of the list, and the numbers which haven’t been crossed out are the primes less than $50$. Notice that the last sequence of multiples you crossed off while doing this were multiples of $7$.
What’s special about $7$ in this list?
If, instead of using just the numbers from $1$ to $50$ you had used the numbers from $1$ to $1000$, what’s the smallest composite number that would not have been crossed off after crossing off the multiples of $7$?
It is known that a composite integer $a$ has a prime divisor $p$ that satisfies the inequality $p\leq a$. If you let $a=50$, then it will have prime divisor $p$ that is less than or equal to $\sqrt{50}$.The greatest among possible p's is 7. Thus in employing the Sieve you will just cross out the multiples of prime $p$ 2,3,5 and lastly multiples of 7. The numbers that are not cross out are the primes from 1 to 50 which are 2,3,5,7,11,13,17,19,23,29,31,37,41,43 and 47. The special in 7 is that it is the greatest prime that you need to cross out its multiple.