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
During AMC testing, the AoPS Wiki is in read-only mode and no edits can be made.

Difference between revisions of "2005 AMC 10B Problems/Problem 22"

(→‎Problem)
(→‎Solution)
Line 7: Line 7:
 
Since <math>1 + 2 + \cdots + n = \frac{n(n+1)}{2}</math>, the condition is equivalent to having an integer value for <math>\frac{n!}
 
Since <math>1 + 2 + \cdots + n = \frac{n(n+1)}{2}</math>, the condition is equivalent to having an integer value for <math>\frac{n!}
 
{\frac{n(n+1)}{2}}</math>. This reduces, when <math>n\ge 1</math>, to having an integer value for <math>\frac{2(n-1)!}{n+1}</math>. This fraction is an  
 
{\frac{n(n+1)}{2}}</math>. This reduces, when <math>n\ge 1</math>, to having an integer value for <math>\frac{2(n-1)!}{n+1}</math>. This fraction is an  
−
integer unless <math>n+1</math> is an odd prime. There are 8 odd primes less than or equal to 24, so there  
+
integer unless <math>n+1</math> is an odd prime. There are <math>8</math> odd primes less than or equal to <math>24</math>, so there  
  
 
are <math>24 - 8 =  
 
are <math>24 - 8 =  
−
\boxed{\text{(C)}16}</math> numbers less than or equal to 24 that satisfy the condition.
+
\boxed{\textbf{(C) }16}</math> numbers less than or equal to 24 that satisfy the condition.
  
 
==Video Solution==
 
==Video Solution==

Revision as of 15:32, 16 December 2021

Problem

For how many positive integers $n$ less than or equal to $24$ is $n!$ evenly divisible by $1 + 2 + \cdots + n?$

$\textbf{(A) } 8 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 17 \qquad \textbf{(E) } 21$

Solution

Since $1 + 2 + \cdots + n = \frac{n(n+1)}{2}$, the condition is equivalent to having an integer value for $\frac{n!} {\frac{n(n+1)}{2}}$. This reduces, when $n\ge 1$, to having an integer value for $\frac{2(n-1)!}{n+1}$. This fraction is an integer unless $n+1$ is an odd prime. There are $8$ odd primes less than or equal to $24$, so there

are $24 - 8 = \boxed{\textbf{(C) }16}$ numbers less than or equal to 24 that satisfy the condition.

Video Solution

https://youtu.be/Ji5BR4SFkeE

~savannahsolver

See Also

2005 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 21 		Followed by
Problem 23
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
All AMC 10 Problems and Solutions

These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. AMC Logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2005_AMC_10B_Problems/Problem_22&oldid=167814"