Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

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

m (→‎Solution)
(→‎Solution 2)
 
(11 intermediate revisions by 4 users not shown)
Line 1: Line 1:
 
== Problem ==
 
== 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:
+
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>
  
−
== Solution ==  
+
== Solution 1==  
−
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.  
+
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.  Therefore <math>6</math> must divide the given expression.
−
Multiplying the only factors that can be guaranteed gives <math>3\times2=\boxed{\textbf{(E)} \ 6}</math>
+
Plugging in <math>n=2</math> yields <math>6</math>.  So the largest possibility is <math>6</math>.
 +
 
 +
Clearly the answer is <math>\boxed{\textbf{(E)} \ 6}</math>
 +
 
 +
==Solution 2==
 +
In general, <math>r!</math> | <math>n(n+1)(n+2)...(n+r-1)</math> were <math>r</math> and <math>n</math> are integers. So here <math>3!</math> | <math>n^3</math> - <math>n</math> always for any integer <math>n</math>.Hence,the correct answer is <math>6</math>.
 +
<math>\boxed{\textbf{(E)} \ 6}</math>
 +
 
 +
~geometry wizard.
  
 
== See Also ==
 
== See Also ==
Line 12: Line 20:
  
 
[[Category:Introductory Number Theory Problems]]
 
[[Category:Introductory Number Theory Problems]]
 +
{{MAA Notice}}

Latest revision as of 05:08, 6 April 2024

Problem

The largest number by which the expression $n^3 - n$ 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 1

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. Therefore $6$ must divide the given expression. Plugging in $n=2$ yields $6$. So the largest possibility is $6$.

Clearly the answer is $\boxed{\textbf{(E)} \ 6}$

Solution 2

In general, $r!$ | $n(n+1)(n+2)...(n+r-1)$ were $r$ and $n$ are integers. So here $3!$ | $n^3$ - $n$ always for any integer $n$.Hence,the correct answer is $6$. $\boxed{\textbf{(E)} \ 6}$

~geometry wizard.

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1951_AHSME_Problems/Problem_15&oldid=217892"