Integrals I: Feynman's Trick · Superchallenge problem

A minimal-counterexample argument shows every integer $n \ge 2$ has a prime factor. Using the same idea, find the number of integers $n$ with $2 \le n \le 100$ whose smallest prime factor is greater than $7$.