MHB Prove: Is ${2017 \choose 652}$ Divisible by 343?

  • Thread starter Thread starter lfdahl
  • Start date Start date
  • Tags Tags
    Divisibility
lfdahl
Gold Member
MHB
Messages
747
Reaction score
0
Is the binomial coefficient: ${2017 \choose 652 }$ divisible by $343$?

Please prove your statement.
 
Mathematics news on Phys.org
lfdahl said:
Is the binomial coefficient: ${2017 \choose 652 }$ divisible by $343$?

Please prove your statement.

Ley us see how many powers of 7 are there in 2017!

2017 = 288 * 7 +1
288 = 41 * 7 + 1
41 = 5 * 7 + 6
so 288 numbers are divisible by 7. 41 by 49 and 5 by 343 so 288 + 41 + 5 or 334

so 2017! is divisible by $7^{334}$

denominator

652 = 93 * 7 + 1
93 = 13 * 7 + 2
13 = 7* 1 + 6
so 652! is divisible by $7^{107}$

2017 - 652 = 1365

1365 = 195 * 7
195 = 27 * 7 + 6
27 = 3 * 7 + 6
so 1365! is divsible by $7^{225}$ and hence highest power of 7 that devides denominator of ${2017 \choose 652 }$ is 332 and highest power deviding numerator = 334 so $7^2$ devides the numbeer and not $7^3$ and the ans is no
 
kaliprasad said:
Ley us see how many powers of 7 are there in 2017!

2017 = 288 * 7 +1
288 = 41 * 7 + 1
41 = 5 * 7 + 6
so 288 numbers are divisible by 7. 41 by 49 and 5 by 343 so 288 + 41 + 5 or 334

so 2017! is divisible by $7^{334}$

denominator

652 = 93 * 7 + 1
93 = 13 * 7 + 2
13 = 7* 1 + 6
so 652! is divisible by $7^{107}$

2017 - 652 = 1365

1365 = 195 * 7
195 = 27 * 7 + 6
27 = 3 * 7 + 6
so 1365! is divsible by $7^{225}$ and hence highest power of 7 that devides denominator of ${2017 \choose 652 }$ is 332 and highest power deviding numerator = 334 so $7^2$ devides the numbeer and not $7^3$ and the ans is no
Thankyou once again, kaliprasad for your clear cut solution, Nice!

Below is an alternative approach:
Solution:

No, the coefficient is not divisible by $343 = 7^3$.

This can be shown e.g. by means of Kummers theorem:

First, we express the entries in base $7$:

\[\binom{2017}{652}_{10} = \binom{1365+652}{652}=\binom{5611}{1621}_7=\binom{3660+1621}{1621}_7\]

Then, we add the two base $7$ numbers:\[\begin{matrix} \: \: \: \overset{1}{3} \overset{1}{6}60\\+1621\\ \: \: \: \: 5611 \end{matrix}\]The addition involves two carriers, hence by Kummers theorem
the highest power of $7$, that divides the binomial coefficient is $7^2$.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top