Home Competitions KöMaL 2009 A483
For abritrary integers 0<k ≤ n k \le n k ≤ n and a a a >1, define ( n k ) a = ( a n − 1 ) ( a n − 1 − 1 ) ⋅ … ⋅ ( a n − k + 1 − 1 ) ( a k − 1 ) ( a k − 1 − 1 ) ⋅ … ⋅ ( a − 1 ) {\binom{n}{k}}_{a} = \frac{(a^n-1)(a^{n-1}-1)\cdot \ldots \cdot(a^{n-k+1}-1)}{(a^k-1)(a^{k-1}-1) \cdot \ldots \cdot(a-1)} ( k n ) a = ( a k − 1 ) ( a k − 1 − 1 ) ⋅ … ⋅ ( a − 1 ) ( a n − 1 ) ( a n − 1 − 1 ) ⋅ … ⋅ ( a n − k + 1 − 1 ) . (a a a ) Show that ( n k ) a {\binom{n}{k}}_{a} ( k n ) a is an integer. (b b b ) Do there exist integers 0<k k k <n n n <m m m and a a a >1, for which ( m 1 ) a {\binom{m}{1}}_{a} ( 1 m ) a divides ( n k ) a {\binom{n}{k}}_{a} ( k n ) a ?
Official text KöMaL . Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Add a solution
Similar problems
These problems have the most words in common with this statement.
Locator hu-komal/2009/a483 · Tag AERTAXGWF7 · Edit this page on GitHub · Keys: j next, k previous