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 "1976 AHSME Problems/Problem 23"

(Created page with "==Problem 23== For integers <math>k</math> and <math>n</math> such that <math>1\le k<n</math>, let <math>C^n_k=\frac{n!}{k!(n-k)!}</math>. Then <math>\left(\frac{n-2k-1}{k+1}...")
 
 
(One intermediate revision by the same user not shown)
Line 17: Line 17:
 
<cmath>= \binom{n+1}{k+1}-2\binom{n}{k},</cmath>
 
<cmath>= \binom{n+1}{k+1}-2\binom{n}{k},</cmath>
 
so <math>\left(\frac{n-2k-1}{k+1}\right)C^n_k</math> is an integer <math>\boxed{\textbf{(A) }\text{for all }k\text{ and }n}</math>. ~[[User:Jiang147369|jiang147369]]
 
so <math>\left(\frac{n-2k-1}{k+1}\right)C^n_k</math> is an integer <math>\boxed{\textbf{(A) }\text{for all }k\text{ and }n}</math>. ~[[User:Jiang147369|jiang147369]]
 +
 +
 +
==See Also==
 +
{{AHSME box|year=1976|num-b=22|num-a=24}}
 +
{{MAA Notice}}

Latest revision as of 14:49, 17 August 2021

Problem 23

For integers $k$ and $n$ such that $1\le k<n$, let $C^n_k=\frac{n!}{k!(n-k)!}$. Then $\left(\frac{n-2k-1}{k+1}\right)C^n_k$ is an integer

$\textbf{(A) }\text{for all }k\text{ and }n\qquad \\ \textbf{(B) }\text{for all even values of }k\text{ and }n,\text{ but not for all }k\text{ and }n\qquad \\ \textbf{(C) }\text{for all odd values of }k\text{ and }n,\text{ but not for all }k\text{ and }n\qquad \\ \textbf{(D) }\text{if }k=1\text{ or }n-1,\text{ but not for all odd values }k\text{ and }n\qquad \\ \textbf{(E) }\text{if }n\text{ is divisible by }k,\text{ but not for all even values }k\text{ and }n$


Solution

We know $C^n_k = \binom{n}{k}$, so let's rewrite the expression as $\left(\frac{n-2k-1}{k+1}\right) \binom{n}{k}$. Notice that \[n-2k-1 = n-2(k+1)+1 = (n+1)-2(k+1).\]

This allows us to rewrite the expression as \[\left(\frac{(n+1)-2(k+1)}{k+1}\right) \binom{n}{k}.\]

From here, we just have to do some algebra to get \[\left(\frac{(n+1)-2(k+1)}{k+1}\right) \binom{n}{k} = \left( \frac{n+1}{k+1}-2 \right) \frac{n!}{k!(n-k)!}\] \[= \frac{(n+1)!}{(k+1)!(n-k)!} - 2 \cdot \frac{n!}{k!(n-k)!}\] \[= \binom{n+1}{k+1}-2\binom{n}{k},\] so $\left(\frac{n-2k-1}{k+1}\right)C^n_k$ is an integer $\boxed{\textbf{(A) }\text{for all }k\text{ and }n}$. ~jiang147369


See Also

1976 AHSME (Problems • Answer Key • Resources)
Preceded by
Problem 22 		Followed by
Problem 24
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
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=1976_AHSME_Problems/Problem_23&oldid=160484"