Difference between revisions of "1951 AHSME Problems/Problem 15"

(Created page with "== Problem == The largest number by which the expression <math> n^3 \minus{} n</math> is divisible for all possible integral values of <math> n</math>, is: <math> \textbf{(A)}\ ...")
 
(Solution)
Line 5: Line 5:
  
 
== Solution ==  
 
== Solution ==  
{{solution}}
+
Factoring the polynomial gives <math>(n+1)(n)(n-1)</math> 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 <math>3\times2=\boxed{\text{A}({6})}</math>
  
 
== See Also ==
 
== See Also ==

Revision as of 20:05, 11 January 2013

Problem

The largest number by which the expression $n^3 \minus{} n$ (Error compiling LaTeX. Unknown error_msg) is divisible for all possible integral values of $n$, is:

$\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6$

Solution

Factoring the polynomial gives $(n+1)(n)(n-1)$ 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 $3\times2=\boxed{\text{A}({6})}$

See Also

1951 AHSC (ProblemsAnswer KeyResources)
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