1984 AHSME Problems/Problem 3

Revision as of 08:46, 8 November 2016 by Topnotchmath (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $n$ be the smallest nonprime integer greater than $1$ with no prime factor less than $10$. Then

$\mathrm{(A) \ }100<n\leq110 \qquad \mathrm{(B) \ }110<n\leq120 \qquad \mathrm{(C) \ } 120<n\leq130 \qquad \mathrm{(D) \ }130<n\leq140 \qquad \mathrm{(E) \ } 140<n\leq150$

Solution

Since the number isn't prime, it is a product of two primes. If the least integer were a product of more than two primes, then one prime could be removed without making the number prime or introducing any prime factors less than $10$. These prime factors must be greater than $10$, so the least prime factor is $11$. Therefore, the least integer is $11^2=121$, which is in $\boxed{\text{C}}$.

See Also

1984 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 2
Followed by
Problem 4
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png