He-Xia Ni, Hao 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}}.$$
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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.
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 $…
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…
We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.
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.
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…
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.
For any positive integers $m$ and $α$, we prove that $$\sum_{k=0}^{n-1}ε^k(2k+1)A_k^{(α)}(x)^m\equiv0\pmod{n}, $$ where $ε\in\{1,-1\}$ and $$ A_n^{(α)}(x)=\sum_{k=0}^n\binom{n}{k}^α\binom{n+k}{k}^αx^k.$$
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.
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.
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.
The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients in the polynomial $$ \sum_{k=0}^{n-1}\varepsilon^k(2k+1) S_k^{(r)}(x_0,\ldots,x_k)^m $$ are multiples of $n$. This generalizes a recent result of Pan on the divisibility of sums of Apéry polynomials.
On the divisibility of sums of Fibonacci numbers
本文证明存在无穷多个奇数 $n$，使前 $n$ 个非零斐波那契数之和能被 $n$ 整除，从而解决 Fatehizadeh 与 Yaqubi 的猜想。
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.
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}}. $$
We prove that a certain family of sums of products of three binomials has alternating behavior modulo a prime $p$. To accomplish this we rewrite these sums as signed sums of products of three binomials, the better to handle $p$, and we give closed-form expressions for two related sums of signed products of three binomials.
We prove some 3-adic congruences for binomial sums, which were conjectured by Sun.
We confirm several conjectures of Guo, Jouhet and Zeng concerning the factors of alternative binomials sums.
In this note, we confirm two conjectural supercongruences on double sums of binomial coefficients due to El Bachraoui.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
We establish $q$-analogs for four congruences involving central binomial coefficients. The $q$-identities necessary for this purpose are shown via the $q$-WZ method.
Due to some results by John P. D Angelo and Dusty Grundmeier about CR- mappings the main results of my 2001 paper about recurrences for some sequences of binomial sums can be simplified.
Periodic Weighted Sums of Binomial Coefficients
本文用初等方法建立了二项式系数与斐波那契数、卢卡斯数等之间的新旧关系。
We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are divisible by arbitrarily large powers of prime $p$.
A $q$-analogue of Boyadzhiev-Mneimneh-type binomial sums of finite multi-polylogarithms
该研究给出有限多重多重对数的Boyadzhiev-Mneimneh型二项式和的$q$-模拟公式，其$q\ o1$极限等价于Sakugawa-Seki恒等式，还给出对应柯西二项式定理的该类和的公式。
We establish a $q$-analogue of Sun--Zhao's congruence on harmonic sums. Based on this $q$-congruence and a $q$-series identity, we prove a congruence conjecture on sums of central $q$-binomial coefficients, which was recently proposed by Guo. We also deduce a $q$-analogue of a congruence due to Apagodu and Zeilberger from Guo's $q$-congruence.
Fibonacci sums and divisibility properties
本文利用 Sury 多项式恒等式的变体推导有限斐波那契与卢卡斯和的新表达式，并将其推广到相关多项式及 Horadam 序列，进而用于发现和证明整除性质。
Three combinatorial sums involving central binomial coefficients
本文研究三类含中心二项式系数及不同调和数的组合和，通过分部求和建立递归式，并用第二类 Stirling 数与 r-Stirling 数给出闭合形式。
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 prove that for any nonnegative integers $n$ and $r$ the binomial sum $$ \sum_{k=-n}^n\binom{2n}{n-k}k^{2r} $$ is divisible by $2^{2n-\min\{α(n),α(r)\}}$, where $α(n)$ denotes the number of 1's in the binary expansion of $n$. This confirms a recent conjecture of Guo and Zeng.
In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have $$\binom {2k}k | \binom{4n+2k+2}{2n+k+1}\binom{2n+k+1}{2k}\binom{2n-k+1}n$$ and $$\binom{2k}k | (2n+1)\binom{2n}nC_{n+k}\binom{n+k+1}{2k},$$ where $C_m$ denotes the Catalan number $\binom{2m}m/(m+1)=\binom{2m}m-\binom{2m}{m+1}$. Applying this result we obtain two sums divisible by central binomial coefficients.
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.
We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer $r$, there holds {align*} \sum_{k=0}^{n_1}ε^k (2k+1)^{2r+1}\prod_{i=1}^{m} {n_i+n_{i+1}+1\choose n_i-k} \equiv 0 \mod (n_1+n_m+1){n_1+n_m\choose n_1}, {align*} and conjecture that for any nonnegative integer $r$ and positive integer $s$ such that $r+s$ is odd, $$ \sum_{k=0}^{n}ε^k (2k+1)^{r}({2n\choose n-k}-{2n\choose n-k-1})^{s} \equiv 0 \mod{2n\choose n}, $$…
Z.-W. Sun introduced three kinds of numbers: \begin{align*}S_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1),\qquad s_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}\frac{1}{2k-1}, \end{align*} and $S_n^{+}=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1)^2$. In this paper we mainly prove that \begin{align*} 4\sum_{k=0}^{n-1}kS_k\equiv \sum_{k=0}^{n-1}s_k\equiv \sum_{k=0}^{n-1}S_k^{+}\equiv 0\pmod{n^2}\quad\text{for $n\geqslant 1$}, \end{align*} by establishing some binomial coefficient identities, such as \begin{align*} 4\sum_{k=0}^{n-1}kS_k=n^2\sum_{k=0}^{n-1}\frac{1}{k+1}{2k\choose k}(6k{n-1\c…
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.
Using elementary methods, we determine the highest power of 2 dividing a power sum 1^n + 2^n + . . . + m^n, generalizing Lengyel's formula for the case where m is itself a power of 2. An application is a simple proof of Moree's result that, if (a,m,n) is any solution of the generalized Erdos-Moser Diophantine equation 1^n + 2^n + . . . + (m-1)^n = am^n, then m is odd.
In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack n_1}^{-1}\sum_{k=-n_1}^{n_1}(-1)^kq^{jk^2+{k\choose 2}} \prod_{i=1}^m {n_i+n_{i+1}\brack n_i+k}\in \N[q], which generalizes a result of Calkin [Acta Arith. 86 (1998), 17--26]. Moreover, we show that for all positive integers n, r and j, {2n\brack n}^{-1}{2j\brack j} \sum_{k=j}^n(-1)^{n-k}q^{A}\frac{1-q^{2k+1}}{1-q^{n+k+1}} {2n\brack n-k}{k+j\brack k-j}^r\in N[q], where A=(r-1){n\c…
By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial coefficients and an odd power of a natural number. For example, we prove that for all positive integers $n_1, ..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer $r$, the expression $$n_1^{-1}{n_1+n_{m}\choose n_1}^{-1} \sum_{k=1}^{n_1}k^{2r+1}\prod_{i=1}^{m} {n_i+n_{i+1}\choose n_i+k}$$ is either an integer or a half-integer. Moreover, several related conj…
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 prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.
Let q>1 and m>0 be relatively prime integers. We find an explicit period $ν_m(q)$ such that for any integers n>0 and r we have $[n+ν_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q), or a=1 (mod q) and 2|m, where $[n,r]_m(a)=\sum_{k=r(mod m)}\binom{n}{k}a^k$. This is a further extension of a congruence of Glaisher.
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 obtain several estimates for bilinear form with exponential sums with binomials $mx^k + nx^\ell$. In particular we show the existence of nontrivial cancellations between such sums when the coefficients $m$ and $n$ vary over rather sparse sets of general nature
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $π$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of generating series. For these generating series, we derive integral representations in terms of root-valued iterated integrals. Using substitutions, we express the interated integrals as cyclotomic harmonic polylogarithms. Finally, by applying known relations among the cyclotomic harmonic polylogarithms, we derive expressions in terms of several constants.
$p$-adic multiple zeta values and binomial multiple harmonic sums
本文提出了一种方法，用于推导$p$-adic多重ζ值的显式公式，引入了二项多重调和和作为关键工具。
We study the divisibility by 3^k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3^k divides the Kloosterman sum K(a). This gives a new simple test for zeros of such Kloosterman sums.
We prove that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and non-negative integers $j$ and $r$ with $j\leqslant m$, the following two expressions \begin{align*} &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack n_1}^{-1}\sum_{k=0}^{n_1} q^{j(k^2+k)-(2r+1)k}[2k+1]^{2r+1}\prod_{i=1}^m {n_i+n_{i+1}+1\brack n_i-k},\\[5pt] &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack n_1}^{-1}\sum_{k=0}^{n_1}(-1)^k q^{{k\choose 2}+j(k^2+k)-2rk}[2k+1]^{2r+1}\prod_{i=1}^m {n_i+n_{i+1}+1\brack n_i-k} \end{align*} are Laurent polynomials in $q$ with integer coefficients, where $[n]=1+q+\cdots+q^{n-1}$ and ${n\brack k…
In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For example, we show that if $n\ge m-1$ then $$\sum_{i=0}^{\lfloor(m-1)/2\rfloor}(-1)^i\binom{m-1-i}i [n-2i,r-i]_m=2^{n-m+1}.$$ We also apply such results to investigate Bernoulli and Euler polynomials. Our approach depends heavily on an identity established by the author [Integers 2(2002)].
Divisibility tests are algorithms that can quickly decide if one integer is divisible by another. There are many tests but most are either of the trimming or summing variety. Our goals are to present Zbikowski's family of trimming tests as one test and to unify the trimming and summing tests. We do the latter by showing, first, that the most effective summing tests, due to Khare, can be derived directly from the Zbikowski's test and, second, that the best known summing tests - the binomial tests - can be derived from an adapted form of Zbikowski's tests. We introduce the notion of stacking, th…
Recently the first author proved a congruence proposed in 2006 by Adamchuk: $\sum_{k=1}^{\lfloor\frac{2p}{3}\rfloor}\binom{2k}{k}\equiv 0\pmod{p^2}$ for any prime $p=1 \pmod{3}$. In this paper, we provide more examples (with proofs) of congruences of the same kind $$\sum_{k=1}^{\lfloor\frac{ap}{r}\rfloor}\binom{2k}{k}x^k \pmod{p^2}$$ where $p$ is a prime such that $p\equiv 1 \pmod{r}$, $a/r$ is a fraction in $(1/2,1)$ and $x$ is a $p$-adic integer. The key ingredients are the $p$-adic Gamma functions $Γ_p$ and a special class of computer-discovered hypergeometric identities.
Mneimneh-type Binomial Sums of Multiple Harmonic-type Sums
本文利用斯特林数、贝尔数及相关变量，建立了涉及多重调和型和的Mneimneh型二项式和的表达式，并应用Toeplitz原理得到联系多重zeta星值与多重多对数的新恒等式。
Sums of powers of binomials, their Apéry limits, and Franel's suspicions
本文显式确定了二项式系数幂和的Apéry极限，并在假设递归可通过创造性望远镜法获得的前提下，证明了关于这些序列递归阶的Franel猜想的最小阶版本。
Carnevale and Voll conjectured that j (--1) j $λ$ 1 j $λ$ 2 j = 0 when $λ$ 1 and $λ$ 2 are two distinct integers. We check the conjecture when either $λ$ 2 or $λ$ 1 -- $λ$ 2 is small. We investigate the asymptotic behaviour of their sum when the ratio r := $λ$ 1 /$λ$ 2 is fixed and $λ$ 2 goes to infinity. We find an explicit range r $\ge$ 5.8362 on which the conjecture is true. We show that the conjecture is almost surely true for any fixed r. For r close to 1, we give several explicit intervals on which the conjecture is also true.
Binomial sums and properties of the Bernoulli transform
本文研究了二项式和Sₙ(q)的性质，探讨了其与伯努利变换的关系，并给出了与阿佩尔多项式相关的恒等式。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。