On the order of prime powers dividing \({2n\choose n}\) (Q1346035): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02392802 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2041864045 / rank | |||
Normal rank |
Latest revision as of 11:13, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the order of prime powers dividing \({2n\choose n}\) |
scientific article |
Statements
On the order of prime powers dividing \({2n\choose n}\) (English)
0 references
17 April 1995
0 references
The middle binomial coefficients \(\left( \begin{smallmatrix} 2n\\ n\end{smallmatrix} \right)\) used by Chebyshev in elementary prime number theory enjoy the interesting arithmetical property to have many different prime factors. However, in spite of such ``almost squarefreeness'', they have prime factors of increasingly high multiplicity for \(n\to \infty\), as shown by the author in a previous paper [J. Reine Angew. Math. 430, 1- 20 (1992; Zbl 0759.11004)]. In the present paper, this result is made more quantitative. Let \(E(n)\) be the maximal multiplicity of prime factors of \(\left( \begin{smallmatrix} 2n\\ n\end{smallmatrix} \right)\). The lower bound \(E(n) \gg (\log n/(\log \log n)^ 3 )^{1/10}\) is given in the main theorem. The principal tool in its proof is Vinogradov's method of exponential sums. The author conjectures that \(\log n\) is presumably the true order of \(E(n)\).
0 references
binomial coefficients
0 references
maximal multiplicity of prime factors
0 references
lower bound
0 references
Vinogradov's method of exponential sums
0 references