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 "2019 Mock AMC 10B Problems/Problem 16"
 
Line 11: Line 11:
  
 
Thus, <math> n = 14 + 1 = \boxed{(E) 15}.</math>
 
Thus, <math> n = 14 + 1 = \boxed{(E) 15}.</math>
 +
 +
Note: <math>g</math> does not need to be <math>\geq 1</math> because the inequality <math>a+b+c+d+e+f\leq n</math> is not strict. So this solution is incorrect.

Latest revision as of 13:06, 11 August 2024

Solution by excruciating: For each of $a,b,c,d,e,f,g$, they all need to be at least $1$, so we have: $7 +a+b+c+d+e+f+g\leq n,$ or $a+b+c+d+e+f+g \leq n-7$ without the "$a,b,c,d,e,f,g$ need to be $>0$ restriction." So now it's stars and bars:

${n-7+7-1 \choose 7-1},$ which simplifies to \[{n-1 \choose 6},\] which we can write as $\frac{(n-1)!}{6! \cdot (n-7)!} = 3003$.

Expanding, we get $(n-1)(n-2)(n-3)(n-4)(n-5)(n-6) = 3003 \cdot 6! = 2^4 \cdot 3^3 \cdot 5 \cdot 7 \cdot 11\ cdot 13$.

Because we only have $6$ terms, $(n-1)$ is to be around $13,$ the highest divisor. Thus, we must have $5\cdot2 = 10$ as a divisor too. $2^2 \cdot 3 = 12$ is one too. We have left is $2, 3^2,$ and $7$, to make $2$ terms, so we have $3^2 = 9$, and $7\cdot2 = 14$. Thus we have: \[(n-1)(n-2)(n-3)(n-4)(n-5)(n-6) = 14\cdot13\cdot12\cdot11\cdot10\cdot9.\]

Thus, $n = 14 + 1 = \boxed{(E) 15}.$

Note: $g$ does not need to be $\geq 1$ because the inequality $a+b+c+d+e+f\leq n$ is not strict. So this solution is incorrect.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2019_Mock_AMC_10B_Problems/Problem_16&oldid=224928"