Xiaogang Liu
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.
机构、总结、中文摘要均由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.
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…
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 examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.
Some divisibility properties of binomial and q-binomial coefficients
首先证明了如果$a$有一个素因子不整除$b$，则有无穷多个正整数$n$使得$\binom {an+bn} {an}$不能被$bn+1$整除.这证实了Z. W.太阳此外，我们还给出了二项式系数的一些新的整除性质：例如，我们证明了对所有正整数$n$，$\binom {12n} {3n}$和$\binom {12n} {4n}$都可被$6n-1$整除，以及$\binom {330n} {88n}$可被$66n-1$整除。正如我们所示，后者的结果实际上是后果的整除和积极的结果，$q$ -二项式系数的同数的$q$ -整数，推广的积极的$q$ -Catalan数。并提出了几点相关建议。
Proof of Sun's conjecture on the divisibility of certain binomial sums
本文证明了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}. $$，方法是显示左侧除右侧的每个被加数。
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.
Proof of a conjecture related to divisibility properties of binomial coefficients
设$a,b$和$n$是正整数，其中$a>b$。本文证明了$$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$，这证实了Amdeberhan和Moll最近的一个猜想.
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…
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…
Proof of two divisibility properties of binomial coefficients conjectured by Z.-W. Sun
对所有正整数n，我们证明了下列整除性质：$$(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}.$$这证实了Z. W.太阳给出了一些类似的整除性质。此外，我们证明了，对于所有的正整数m和n，产品$am{am+bm-1\choose am}{an+bn\choose an}$是由m+n整除。实际上，后一个结果可以推广到q-二项式系数和q-整数的情形，从而推广了q-Catalan数的正性.我们还提出了几个相关的建议。
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.
Fibonacci sums and divisibility properties
本文利用 Sury 多项式恒等式的变体推导有限斐波那契与卢卡斯和的新表达式，并将其推广到相关多项式及 Horadam 序列，进而用于发现和证明整除性质。
On divisibility concerning binomial coefficients
设k和n为正整数。主要证明了$$(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)},$$和$$\binom{3n}{n} | \binom{5n-1}{n-1}C_{5n}^{(2)},$$，其中C_n表示Catalan数$\binom{2n}{n}/(n+1)$，C_m^{（h）}表示h阶Catalan数$\binom{(h+1)m}{m}/(hm+1)$.
On divisibility of sums of Apery polynomials
对任意正整数$m$和$α$，我们证明了$$\sum_{k=0}^{n-1}ε^k(2k+1)A_k^{(α)}(x)^m\equiv0\pmod{n}, $$，其中$ε\in\{1,-1\}$和$$ 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.
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 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.
We present a survey on Weil sums in which an additive character of a finite field $F$ is applied to a binomial whose individual terms (monomials) become permutations of $F$ when regarded as functions. Then we indicate how these Weil sums are used in applications, especially how they characterize the nonlinearity of power permutations and the correlation of linear recursive sequences over finite fields. In these applications, one is interested in the spectrum of Weil sum values that are obtained as the coefficients in the binomial are varied. We review the basic properties of such spectra, and …
Divisibility of Power Sums and the Generalized Erdos-Moser Equation
使用初等方法，我们确定2的最高幂除以幂和1^n + 2^n +。. . + m^n，推广了Lengyel的公式，其中m本身是2的幂。Moree的结果的一个应用是：如果（a，m，n）是广义Erdos-Moser丢番图方程1 ^n +2 ^n+的任意解，则（a，m，n）是该结果的一个简单证明. . . + （m-1）^n = am^n，则m是奇数。
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…
Factors of Some Lacunary q-Binomial Sums
本文证明了缺项$q$的一个整除性结果--二项式和$$ \sum_{k\equiv r\pmod{c}}(-1)^kq^{\binom{k}{2}}\qbinom{n}{k}{q}\qbinom{(k-r)/c}{l}{q^{c}}. $$
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.
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…
Congruences for central binomial sums and finite polylogarithms
我们证明了同余，模幂的素数p，某些有限和涉及中心二项式系数$\binom{2k}{k}$。
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.
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.
The Weil sum $W_{K,d}(a)=\sum_{x \in K} ψ(x^d + a x)$ where $K$ is a finite field, $ψ$ is an additive character of $K$, $d$ is coprime to $|K^\times|$, and $a \in K^\times$ arises often in number-theoretic calculations, and in applications to finite geometry, cryptography, digital sequence design, and coding theory. Researchers are especially interested in the case where $W_{K,d}(a)$ assumes three distinct values as $a$ runs through $K^\times$. A Galois-theoretic approach, combined with $p$-divisibility results on Gauss sums, is used here to prove a variety of new results that constrain which …
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
Some 3-adic congruences for binomial sums
本文证明了Sun等人提出的关于二项和的3-adic同余。
Factors of alternative binomials sums
我们证实了郭、Jouhet和曾关于择一二项式和因子的几个定理。
$p$-adic multiple zeta values and binomial multiple harmonic sums
本文提出了一种方法，用于推导$p$-adic多重ζ值的显式公式，引入了二项多重调和和作为关键工具。
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.
Mneimneh-type Binomial Sums of Multiple Harmonic-type Sums
本文利用斯特林数、贝尔数及相关变量，建立了涉及多重调和型和的Mneimneh型二项式和的表达式，并应用Toeplitz原理得到联系多重zeta星值与多重多对数的新恒等式。
Some $q$-analogs of congruences for central binomial sums
我们建立了四个包含中心二项式系数的同余式的$q$ -模拟。通过$q$ -WZ方法显示了为此目的所需的$q$ -恒等式。
Recurrences for some sequences of binomial sums II: A simpler approach
由于John P.D. Angelo和Dusty Grundmeier关于CR-映射的一些结果，我2001年关于某些二项式和序列的递归性的论文的主要结果可以被简化。
We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} χ(x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} χ_1 (x)χ_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for $m\geq 2$ if $p\nmid ABk$).
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 consider Weil sums of binomials of the form $W_{F,d}(a)=\sum_{x \in F} ψ(x^d-a x)$, where $F$ is a finite field, $ψ\colon F\to {\mathbb C}$ is the canonical additive character, $\gcd(d,|F^\times|)=1$, and $a \in F^\times$. If we fix $F$ and $d$ and examine the values of $W_{F,d}(a)$ as $a$ runs through $F^\times$, we always obtain at least three distinct values unless $d$ is degenerate (a power of the characteristic of $F$ modulo $|F^\times|$). Choices of $F$ and $d$ for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if $F$ is …
Evaluating Binomial Character Sums Modulo Powers of Two
我们表明，对于任何模$2^m$字符，$χ_1, χ_2,$的完全指数和，$$ \sum_{x=1}^{2^m}χ_1(x) χ_2(Ax^k+B), $$有一个简单的显式评估。
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.
Three combinatorial sums involving central binomial coefficients
本文研究三类含中心二项式系数及不同调和数的组合和，通过分部求和建立递归式，并用第二类 Stirling 数与 r-Stirling 数给出闭合形式。
A double-sum analogue of Whipple's summation formula and a restricted sum formula for multiple binomial sums
该研究证明了Whipple的{}_3F_2求和公式的双重和模拟式，并将其应用得到Igarashi参数化多重zeta级数特殊情形下多重二项和的受限求和公式
We study the well-known lacunary sums of binomial coefficients considered, most notably, by Christian Ramus, and their connection to a special kind of harmonic number associated with the first case of Fermat's Last Theorem. For one case of Ramus's famous identity we obtain a variation in which some of the parameters are replaced by square matrices of arbitrary dimension.
Generic twisted $T$-adic exponential sums of binomials
研究了与$x^{d}+λx$相关的扭曲$T$ -adic指数和.如果是$λ\neq0,$，则证明了一个显式算术多边形是T-adic指数和的扭曲$C$ -函数的牛顿多边形.给出了扭曲$p$幂阶指数和的$L$ -函数的牛顿多边形.
This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling numbers of the second kind. In certain cases we obtain asymptotic expansions involving Bernoulli polynomials, poly-Bernoulli polynomials, or Euler polynomials. We also discuss connections to Euler series transformations and other series transformation formulas.
The $p$-adic Order of Power Sums, the Erdös-Moser Equation, and Bernoulli Numbers
Erdös-Moser方程是60多年前提出的一个丢番图方程，至今仍未得到解决。在本文中，我们认为这个问题的整除的权力和某些埃及分数方程。因此，我们表明，解决方案必须满足强整除性和限制性埃及分数方程。我们的研究使我们的结果伯努利数，并使我们能够激励莫泽的原始方法的问题。
We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$, and then use it to improve the bound of Akulinichev (1965) from $O(p^{5/6})$ to $O(p^{4/5})$ for $n | (p-1)$. The result is based on a new bound on the number of solutions and of degrees of irreducible components of certain equations over finite fields.
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.
On 2-adic orders of some binomial sums
证明了对任意非负整数$n$和$r$，二项式和$$ \sum_{k=-n}^n\binom{2n}{n-k}k^{2r} $$可被$2^{2n-\min\{α(n),α(r)\}}$整除，其中$α(n)$表示$n$的二进制展开式中1的个数.这证实了郭和曾的一个猜想。
Products and sums divisible by central binomial coefficients
本文主要研究可被中心二项式系数整除的乘积与和。我们证明了2（2n+1）binom（2n，n）|binom（6n，3n）binom（3n，n），其中n= 1，2，3，.此外，对于任何非负整数$k$和$n$，我们有$$\binom {2k}k | \binom{4n+2k+2}{2n+k+1}\binom{2n+k+1}{2k}\binom{2n-k+1}n$$和$$\binom{2k}k | (2n+1)\binom{2n}nC_{n+k}\binom{n+k+1}{2k},$$，其中$C_m$表示加泰罗尼亚数$\binom{2m}m/(m+1)=\binom{2m}m-\binom{2m}{m+1}$。应用这个结果，我们得到两个可被中心二项式系数整除的和。
New sums mixing harmonic numbers and central binomial coefficients
本文提出了一种混合调和数与中心二项式系数的新和类，并建立了相关幂和的递归解。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。