Difference between revisions of "1951 AHSME Problems/Problem 15"
Mathgeek2006 (talk | contribs) m (→Problem) |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | The largest number by which the expression <math> n^3 | + | The largest number by which the expression <math> n^3 - n</math> is divisible for all possible integral values of <math> n</math>, is: |
<math> \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6</math> | <math> \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6</math> | ||
Revision as of 21:57, 13 March 2015
Problem
The largest number by which the expression 
is divisible for all possible integral values of 
, is:
Solution
Factoring the polynomial gives 
According to the factorization, one of those factors must be a multiple of two because there are more than 2 consecutive integers. In addition, because there are three consecutive integers, one of the integers must be a multiple of 3.
Multiplying the only factors that can be guaranteed gives 
See Also
| 1951 AHSC (Problems • Answer Key • Resources) | ||
| Preceded by Problem 14 |
Followed by Problem 16 | |
| 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 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 • 40 • 41 • 42 • 43 • 44 • 45 • 46 • 47 • 48 • 49 • 50 | ||
| All AHSME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
