Difference between revisions of "1984 AHSME Problems/Problem 3"
m (→Solution) |
m (→Problem) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| − | Let <math> n </math> be the smallest nonprime [[ | + | Let <math> n </math> be the smallest nonprime [[integoobs]] greater than <math> 1 </math> with no [[Prime factorization|prime factor]] less than <math> 10 </math>. Then |
<math> \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 </math> | <math> \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 </math> | ||
Revision as of 19:31, 7 November 2016
Problem
Let 
be the smallest nonprime integoobs greater than 
with no prime factor less than 
. Then
Solution
To solve the problem, you would have to find the smallest prime number greater than ten: eleven. So, the smallest number with eleven as prime factorization and greater than 100 = 11^2 (i.e. 121). Which is in 
.
See Also
| 1984 AHSME (Problems • Answer Key • Resources) | ||
| 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. 
