ON THE GREATEST COMMON DIVISOR OF BINOMIAL COEFFICIENTS
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Let $n\geqslant 2$ be an integer, we denote the smallest integer $b$ such that $\gcd\qty{\binom nk: b<k<n-b}>1$ as $b(n)$. For any prime $p$, we denote the highest exponent $\alpha$ such that $p^\alpha\mid n$ as $v_p(n)$. In this paper, we partially answer a question asked by Hong in 2016. For a composite number $n$ and a prime number $p$ with $p\mid n$, let $n=a_mp^m+r$, $0\leqslant r<p^m$, $0<a_m<p$. Then we have\\ \resizebox{\linewidth}{4.5mm}{ $\displaystyle v_p\qty(\gcd\qty{\binom nk: b(n)<k<n-b(n),\ (n,k)>1})= \begin{cases} 1,&a_m=1\text{ and }r=b(n), \\ 0,&\text{otherwise}. \end{cases} $}
Abstract
Let $n\geqslant 2$ be an integer, we denote the smallest integer $b$ such that $\gcd\qty{\binom nk: b<k<n-b}>1$ as $b(n)$. For any prime $p$, we denote the highest exponent $\alpha$ such that $p^\alpha\mid n$ as $v_p(n)$. In this paper, we partially answer a question asked by Hong in 2016. For a composite number $n$ and a prime number $p$ with $p\mid n$, let $n=a_mp^m+r$, $0\leqslant r<p^m$, $0<a_m<p$. Then we have\\ \resizebox{\linewidth}{4.5mm}{ $\displaystyle v_p\qty(\gcd\qty{\binom nk: b(n)<k<n-b(n),\ (n,k)>1})= \begin{cases} 1,&a_m=1\text{ and }r=b(n), \\ 0,&\text{otherwise}. \end{cases} $}
참고문헌 (16)
- Joe Albree, "The gcd of Certain Binomial Coefficients", Mathematics Magazine, 45(5), pp.259~ (1972), Informa UK Limited[DOI]
- Tom M. Apostol, "Introduction to Analytic Number Theory", Undergraduate Texts in Mathematics (1976), Springer New York[DOI]
- R. C. Baker, "The Difference Between Consecutive Primes, II", Proceedings of the London Mathematical Society, 83(3), pp.532~562 (2001), Wiley[DOI]
- Siao Hong, "The greatest common divisor of certain binomial coefficients", Comptes Rendus. Mathématique, 354(8), pp.756~761 (2016), Cellule MathDoc[DOI]
- H Joris, "The greatest common divisor of certain sets of binomial coefficients", Journal of Number Theory, 21(1), pp.101~119 (1985), Elsevier BV[DOI]
- G. Kaplan, "GCD of truncated rows in Pascal's triangle", Integers, 4(A14), pp.20~ (2004)
- Neal Koblitz, "Graduate Texts in Mathematics", pp.58~ (1984), Springer
- Ouvrages de Mathematiques de la SMC, "CMS Books in Mathematics", pp.2001, M. Krizek
- E. E. Kummer, "Uber die Erganzungssatze zu den allgemeinen Reciprocitatsgesetzen", J. Reine Angew. Math, 44, pp.93~146 (1852)[DOI]
- Carl McTague, "The Cayley plane and string bordism", Geometry & Topology, 18(4), pp.2045~2078 (2014), Mathematical Sciences Publishers[DOI]
- Carl McTague, "On the Greatest Common Divisor of Binomial Coefficients", The American Mathematical Monthly, 124(4), pp.353~ (2017), Informa UK Limited[DOI]
- N. S. Mendelsohn, "Divisors of binomial coefficients", The American Mathematical Monthly, 78(2), pp.201~ (1971), JSTOR[DOI]
- Laurenţiu Panaitopol, "Some of the Properties of the Sequence of Powers of Prime Numbers", Rocky Mountain Journal of Mathematics, 31(4) (2001), Rocky Mountain Mathematics Consortium[DOI]
- B. Ram, "Common Factors of ${\frac{n!}{n!(n-m)!}}$, (m = 1, 2, . . . , n - 1)", J. Indian Math. Club, 1, pp.39~43 (1909)
- Christophe Soulé, "Secant varieties and successive minima", Journal of Algebraic Geometry, 13(2), pp.323~341 (2004), American Mathematical Society (AMS)[DOI]
- J. Xiao, "The Greatest Common Divisor of Certain Set of Binomial Coeffcients", Math. Theory Appl, 42(1), pp.85~91 (2022)