In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is divisible by at least one of $p$ or $q$. We give conditions under which a number $n$ has this property and discuss a variant of this problem involving more than two primes. We prove that every positive integer $n$ has infinitely many multiples with this property.
In this paper we compute the exact divisibility of exponential sums associated to binomials $F(X)=aX^{d_1} +b X^{d_2}$. In particular, for the case where $\max\{d_1,d_2\}\leq\sqrt{p-1}$, the exact divisibility is computed. As a byproduct of our results, we obtain families of binomials that do not permute $\mathbb{F}_p$, and a lower bound for the sizes of value sets of binomials over $\mathbb{F}_p$. Additionally, we obtain a new criterion to determine if a polynomial defines or not a permutation of $\mathbb{F}_p$ that depends on the divisibility of the exponential sum associated to the polynomi…
In this paper, we prove the following result conjectured by Z.-W. Sun: $$ (2n-1){3n\choose n}| \sum_{k=0}^{n}{6k\choose 3k}{3k\choose k}{6(n-k)\choose 3(n-k)}{3(n-k)\choose n-k}. $$ by showing that the left-hand side divides each summand on the right-hand side.
We prove the divisibility conjecture on sums of even powers of $q$-binomial coefficients, which was recently proposed by Guo, Schlosser and Zudilin. Our proof relies on two $q$-harmonic series congruences due to Shi and Pan.
With help of $q$-congruence, we prove the divisibility of some binomial sums. For example, for any integers $ρ,n\geq 2$, $$\sum_{k=0}^{n-1}(4k+1) \binom{2k}{k}^ρ\cdot (-4)^{ρ(n-1-k)} \equiv 0\pmod{2^{ρ-2}n\binom{2n}{n}}.$$
By using the Rodriguez-Villegas-Mortenson supercongruences, we prove four supercongruences on sums involving binomial coefficients, which were originally conjectured by Sun. We also confirm a related conjecture of Guo on integer-valued polynomials.
We first prove that if $a$ has a prime factor not dividing $b$ then there are infinitely many positive integers $n$ such that $\binom {an+bn} {an}$ is not divisible by $bn+1$. This confirms a recent conjecture of Z.-W. Sun. Moreover, we provide some new divisibility properties of binomial coefficients: for example, we prove that $\binom {12n} {3n}$ and $\binom {12n} {4n}$ are divisible by $6n-1$, and that $\binom {330n} {88n}$ is divisible by $66n-1$, for all positive integers $n$. As we show, the latter results are in fact consequences of divisibility and positivity results for quotients of $…
Francis Castro, et al [2] computed the exact divisibility of families of exponential sums associated to binomials $F(X) = aX^{d_1} + bX^{d_2}$ over $\mathbb{F}_p$, and a conjecture is presented for related work. Here we study this question.
We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.
Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.
In this paper, we consider two particular binomial sums \begin{align*} \sum_{k=0}^{n-1}(20k^2+8k+1){\binom{2k}{k}}^5 (-4096)^{n-k-1} \end{align*} and \begin{align*} \sum_{k=0}^{n-1}(120k^2+34k+3){\binom{2k}{k}}^4\binom{4k}{2k} 65536^{n-k-1}, \end{align*} which are inspired by two series for $\frac{1}{π^2}$ obtained by Guillera. We consider their divisibility properties and prove that they are divisible by $2n^2 \binom{2n}{n}^2$ for all integer $n\geq 2$. These divisibility properties are stronger than those divisibility results found by He, who proved the above two sums are divisible by $2n \b…
For all positive integers n, we prove the following divisibility properties: $$(2n+3){2n\choose n} | 3{6n\choose 3n}{3n\choose n}, and (10n+3){3n\choose n} | 21{15n\choose 5n} {5n\choose n}.$$ This confirms two recent conjectures of Z.-W. Sun. Some similar divisibility properties are given. Moreover, we show that, for all positive integers m and n, the product $am{am+bm-1\choose am}{an+bn\choose an}$ is divisible by m+n. In fact, the latter result can be generalized to the q-binomial coefficients and q-integers case, which generalizes the positivity of q-Catalan numbers. We also propose severa…
For nonnegative integers $j$ and $n$ let $Θ(j,n)$ be the number of entries in the $n$-th row of Pascal's triangle that are not divisible by $2^{j+1}$. In this paper we prove that the family $j\mapstoΘ(j,n)$ usually follows a normal distribution. The method used for proving this theorem involves the computation of first and second moments of $Θ(j,n)$, and uses asymptotic analysis of multivariate generating functions by complex analytic methods, building on earlier work by Drmota (1994) and Drmota, Kauers and Spiegelhofer (2016).
In this paper, we prove two conjectures of Z.-W. Sun: $$2n\binom{2n}n\big|\sum_{k=0}^{n-1}(3k+1)\binom{2k}k^3{16}^{n-1-k}\ \mbox{for}\ \mbox{all}\ n=2,3,\cdots,$$ and $$\sum_{k=0}^{(p-1)/2}\frac{3k+1}{16^k}\binom{2k}{k}^3\equiv p+2\left(\frac{-1}{p}\right)p^3E_{p-3}\pmod{p^4},$$ where $p>3$ is a prime and $E_0,E_1,E_2,\cdots$ are Euler numbers.
We show that for every fixed $\ell\in\mathbb{N}$, the set of $n$ with $n^\ell|\binom{2n}{n}$ has a positive asymptotic density $c_\ell$, and we give an asymptotic formula for $c_\ell$ as $\ell\to \infty$. We also show that $\# \{n\le x, (n,\binom{2n}{n})=1 \} \sim cx/\log x$ for some constant $c$. One novelty is a method to capture the effect of large prime factors of integers in general sequences.
Let k and n be positive integers. We mainly show that $$(ln+1) | k\binom{kn+ln}{kn},$$ $$2\binom{kn}n | \binom {2n}{n}C_{2n}^{(k-1)}$$, $$\binom{kn}n | (2k-1)C_n\binom{2kn}{2n},$$ $$\binom{2n}n | (k+1)C_n^{(k-1)}\binom{2kn}{kn},$$ $$2^{k-1}\binom{2n}{n} | \binom{2(2^k-1)n}{(2^k-1)n}C_n^{(2^k-2)},$$ $$(6n+1)\binom{5n}{n} | \binom{3n-1}{n-1}C_{3n}^{(4)},$$ and $$\binom{3n}{n} | \binom{5n-1}{n-1}C_{5n}^{(2)},$$ where C_n denotes the Catalan number $\binom{2n}{n}/(n+1)$, and C_m^{(h)} refers to the Catalan number $\binom{(h+1)m}{m}/(hm+1)$ of order h.
We establish a congruence on sums of central $q$-binomial coefficients. From this $q$-congruence, we derive the divisibility of the $q$-trinomial coefficients introduced by Andrews and Baxter.
We provide a way to modify and to extend a previously established inequality by P. Erdős, R. Graham and others and to answer a conjecture posed in the nineties by R. Graham, which bears on the lack of divisibility of the central binomial coefficient by three distinct, fixed odd primes. In fact the result will show by using an approach similar to their own which they proved for the case of two fixed odd primes, that the central binomial coefficient is not divisible infinitely often by three distinct and fixed odd primes. Therefore a generalization to more fixed odd primes than three but finite …
We describe the $p$-divisibility transposition for the Fourier coefficients of Siegel modular forms. This provides a supplement to the result by Wilton for $p$-divisibility satisfied by the Ramanujan $τ$-function.
We survey divisibility properties of the Fourier coefficients of modular functions inspired by Ramanujan. Then using recent results of the generalized Hecke operator on harmonic Maass functions and known divisibility of Fourier coefficients of modular functions, we establish congruence relations of the Fourier coefficients of certain modular functions and mock modular functions of various levles.
We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a theorem of Kummer, an upper bound for the number of times that a prime $p_j$ can divide ${2n \choose n}$ is $1+\log n / \log p_j$; and our theorem shows that for every $\varepsilon > 0$, $r \geq 1$, and any sufficiently large primes $p_1,...,p_r > p_0(\varepsilon,r)$, we can find integers $n$ where for $j=1,...,r$, $p_j$ divides ${2n \choose n}$ with multipli…
In this paper, we prove a divisibility result for the lacunary $q$-binomial sum $$ \sum_{k\equiv r\pmod{c}}(-1)^kq^{\binom{k}{2}}\qbinom{n}{k}{q}\qbinom{(k-r)/c}{l}{q^{c}}. $$
Consider the Weil sum $W_{F,d}(u)=\sum_{x \in F} ψ(x^d+u x)$, where $F$ is a finite field of characteristic $p$, $ψ$ is the canonical additive character of $F$, $d$ is coprime to $|F^*|$, and $u \in F^*$. We say that $W_{F,d}(u)$ is three-valued when it assumes precisely three distinct values as $u$ runs through $F^*$: this is the minimum number of distinct values in the nondegenerate case, and three-valued $W_{F,d}$ are rare and desirable. When $W_{F,d}$ is three-valued, we give a lower bound on the $p$-adic valuation of the values. This enables us to prove the characteristic $3$ case of a 19…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider rational roots. This leads to the study of an infinite class of integer sequences which have interesting properties and satisfy linear recurrence relations.
This paper studies the product $\bar{G}_n$ of the binomial coefficients in the n-th row of Pascal's triangle, which equals the reciprocal of the product of all the reduced and unreduced Farey fractions of order n. It studies its size as a real number, measured by its logarithm $log(\bar{G}_n)$, and its prime factorization, measured by the order of divisibility by a fixed prime p, each viewed as a function of n. It derives three formulas for its prime power divisibility, $ord_p(\bar{G}_n)$, two of which relate it to base p radix expansions of n, and which display different facets of its behavio…
We prove divisibility results for the Fourier coefficients of canonical basis elements for the spaces of weakly holomorphic modular forms of weight $0$ and levels $6, 10, 12, 18$ with poles only at the cusp at infinity. In addition, we show that these Fourier coefficients satisfy Zagier duality in all weights, and give a general formula for the generating functions of such canonical bases for all genus zero levels.
Lehner's 1949 results on the $j$-invariant showed high divisibility of the function's coefficients by the primes $p\in\{2,3,5,7\}$. Expanding his results, we examine a canonical basis for the space of level $p$ modular functions holomorphic at the cusp 0. We show that the Fourier coefficients of these functions are often highly divisible by these same primes.
We study a canonical basis for spaces of weakly holomorphic modular forms of weights 12, 16, 18, 20, 22, and 26 on the full modular group. We prove a relation between the Fourier coefficients of modular forms in this canonical basis and a generalized Ramanujan tau-function, and use this to prove that these Fourier coefficients are often highly divisible by 2.
The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study their divisibility properties.
Let m_1,...,m_s be positive integers. Consider the sequence defined by multinomial coefficients: a_n=\binom{(m_1+m_2+... +m_s)n}{m_1 n, m_2 n,..., m_s n}. Fix a positive integer k\ge 2. We show that there exists a positive integer C(k) such that \frac{\prod_{n=1}^t a_{kn}}{\prod_{n=1}^t a_n} \in \frac 1{C(k)} \Z for all positive integer t, if and only if GCD(m_1,...,m_s)=1.
In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the $q$-binomial coefficients.
In this paper we consider the generalized Catalan numbers F(s,n)= 1/((s-1)n+1) binom{sn}{n}. We find all $n$ such that for $p$ prime, p^q divides F(p^q,n), q>=1. As a byproduct we settle a question of Hough and the late Simion on the divisibility of the 4-Catalan numbers. We also prove that \binom{p^qn+1}{n}, p^q<=99999, is squarefree for n sufficiently large (explicit), and with the help of the generalized Catalan numbers we find the set of possible exceptions. As consequences, we obtain that binom{4n+1}{n}, binom{9n+1}{n} are squarefree for n> 2^{1518}, respectively n>3^{956}, with at most 2…
Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients modulo 16 and one about the value of Binomial[n, 2p] modulo n.
This paper contains a number of series whose coefficients are products of central binomial coefficients & harmonic numbers. An elegant sum involving $ζ(2)$ and two other nice sums appear in the last section.
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
Using generalized binomial coefficients with respect to fundamental Lucas sequences we establish congruences that generalize the classical congruence of Wolstenholme and other related stronger congruences.
Some properties of diagonal binomial coefficients were studied in respect to frequency of their units digits. An approach was formulated that led to use of difference tables to predict if certain units digits can appear in the values of binomial coefficients at quadratic terms of the binomial theorem. Frequency distributions of units digits of binomial coefficients contain gaps (zero frequency) under most common numbering systems with supposed exclusion to systems with 2^n bases. Binomial coefficient arithmetics may be used to model cell population dynamics in a multicellular organism, which i…
In this paper, we mainly show that generalized hyperharmonic number sums with reciprocal binomial coefficients can be expressed in terms of classical (alternating) Euler sums, zeta values and generalized (alternating) harmonic numbers.
We develop new closed form representations of sums of (n + α)th shifted harmonic numbers and reciprocal binomial coefficients in terms of αth shifted harmonic numbers. Some interesting new consequences and illustrative examples are considered.
In this paper, we confirm several conjectured congruences of Sun concerning the divisibility of binomial sums. For example, with help of a quadratic hypergeometric transformation, we prove that $$ \sum_{k=0}^{p-1}\binom{p-1}k\binom{2k}k^2\frac{P_k}{8^k}\equiv0\pmod{p^2} $$ for any prime $p\equiv 7\mod{8}$, where $P_k$ is the $k$-th Pell number. Further, we also propose three new congruences of the same type.
By dividing hypergeometric series representations of the inverse sine by sin^-1 (x) and integrating, new double series representations of integers and constants arise. Binomial coefficients and the sine integral are thus combined in double series.
We prove four identities for the squared central binomial coefficients. The first three of them reflect certain transformation properties of the complete elliptic integrals of the first and the second kind, while the last one is based on properties of the Lagrange polynomials.
A sequence of nonzero integers $f = (f_1, f_2, \dots)$ is ``binomid'' if every $f$-binomid coefficient $\left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f$ is an integer. Those terms are the generalized binomial coefficients: \[ \left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f \ = \ \frac{ f_nf_{n-1}\cdots f_{n-k+1} }{ f_kf_{k-1}\cdots f_1 }. \] Let $Δ(f)$ be the infinite triangle with those numbers as entries. When $I = (1, 2, 3, \dots)$ then $Δ(I)$ is Pascal's Triangle so that $I$ is binomid. Surprisingly, every row and column of Pascal's Triangle is also binomid. For any $f$, …
We study divisibility for the $q$-trinomial coefficients $τ_0(n,m,q)$, $T_0(n,m,q)$ and $T_1(n,m,q)$, which were first introduced by Andrews and Baxter. In particular, we completely determine $τ_0(an,bn,q)$, $T_0(an,bn,q)$ and $T_1(an,bn,q)$ modulo the square of the cyclotomic polynomial $Φ_n(q)$ for $(a,b)=(m,m-1)$.
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for binomial coefficients that seem to be new.
The famous irreducibility criteria of Schönemann-Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper we provide several irreducibility criteria of Schönemann-Eisenstein-Dumas-type for polynomials with integer coefficients, criteria that are given by some divisibility conditions for their coefficients with respect to arbitrarily many prime numbers. A special attention will be paid to those irreducibility criteria that require information on the divisibility of the coefficients by two distinct prime numbers.
We present several sequences involving harmonic numbers and the central binomial coefficients. The calculational technique is consists of a special summation method that allows, based on proper two-valued integer functions, to calculate different families of power series which involve odd harmonic numbers and central binomial coefficients. Furthermore it is shown that based on these series a new type of nonlinear Euler sums that involve odd harmonic numbers can be calculated in terms of zeta functions.
Recently, Ni and Pan proved a $q$-congruence on certain sums involving central $q$-binomial coefficients, which was conjectured by Guo. In this paper, we give a generalization of this $q$-congruence and confirm another $q$-congruence, also conjectured by Guo. Our proof uses Ni and Pan's technique and a simple $q$-congruence observed by Guo and Schlosser.
We complete a proof of a theorem that was inspired by an Indian Olympiad problem, which gives an interesting characterization of a prime number $p$ with respect to the binomial coefficients ${n\choose p}$. We also derive a related result which generalizes the theorem in one direction.
We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.
In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order Catalan numbers, the sequence (\seqnum{A176898}) $S_n=\frac{{6n\choose 3n}{3n\choose 2n}}{2{2n\choose n}(2n+1)},$ and the binomial coefficients ${3n\choose n}$ and ${4n\choose 2n}$. As an application, we address several conjectures of Z.\ W.\ Sun on congruences of sums involving $S_n$ and we prove a cubic residuacity criterion in terms of sums of the binomia…
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be written as tuples of linear recurrence sequences. We show that for certain families of norm forms defined over quartic fields, there exist integrally equivalent forms making any one fixed coordinate sequence a linear divisibility sequence.
