Zhi-Wei Sun
Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For ρ=1 or -1, we determine $\prod_{0<c<d, (d/c)=ρ} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the fundamental unit and the class number of E, where (d/c) is the Kronecker symbol.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses the Weil bound from algebraic geometry.
Using a property of the q-shifted factorial, an identity for q-binomial coefficients is proved, which is used to derive the formulas for the q-binomial coefficient for negative arguments. The result is in agreement with an earlier paper about the normal binomial coefficient for negative arguments. Some new q-binomial summation identities are derived, and the formulas for negative arguments transform some of these summation identities into each other. One q-binomial summation identity is transformed into a new q-binomial summation identity.
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.
We construct the generating function for products of inverse central binomial coefficients with harmonic numbers.
We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over Gaussian polynomials or over $q$-binomial coefficients. We investigate basic properties and applications of over $q$-binomial coefficients. In particular, via the recurrences and combinatorial interpretations of over q-binomial coefficients, we prove a Rogers-Ramaujan type partition theorem.
In this paper we establish a $q$-analogue of a congruence of Sun concerning the products of binomial coefficients modulo the square of a prime.
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$.
In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Apéry-like numbers modulo $p^3$, where $p$ is an odd prime.
Loeb showed that a natural extension of the usual binomial coefficient to negative (integer) entries continues to satisfy many of the fundamental properties. In particular, he gave a uniform binomial theorem as well as a combinatorial interpretation in terms of choosing subsets of sets with a negative number of elements. We show that all of this can be extended to the case of Gaussian binomial coefficients. Moreover, we demonstrate that several of the well-known arithmetic properties of binomial coefficients also hold in the case of negative entries. In particular, we show that Lucas' Theorem …
Periodic Weighted Sums of Binomial Coefficients
本文用初等方法建立了二项式系数与斐波那契数、卢卡斯数等之间的新旧关系。
Leading coefficient in the Hankel determinants related to binomial and $q$-binomial transforms
本文将二项式变换下 Hankel 行列式不变的经典结论推广至 $q$-二项式变换，研究其首项系数行为，并利用特殊二项式变换分析偶数下标 Bernoulli 多项式情形。
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 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.
Some elementary remarks on the powers of a partial theta function and corresponding q-analogs of the binomial coefficients
本文研究了偏theta函数的幂及其对应的二项式系数的q-模拟，推导出了该函数正幂和负幂系数的计算公式。
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.
Abstract. We generalize the $b$-ary binomial coefficients with negative entries, which is based on the generating function obtained in early work. Besides an explicit expression involving the restricted partition, several properties such as symmetry, congruence and Pascal-like recurrence are studies. Finally, we also provide two different generalizations, partially satisfying Pascal-like recurrences.
Asymptotic products of binomial and multinomial coefficients revisited
该研究重审二项式与多项式系数的渐近乘积，确定其渐近常数与公式，推导行系数的极限情形，明确常数区间与精确表达式，修正了Hirschhorn的相关结果。
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 $…
In this paper we prove several inequalities for binomial coefficients. For instance, if $ k$ and $n$ are positive integers such that $n\ge 400$ and $[\frac n5]\le k\le [\frac n2]$, where $[x]$ is the greatest integer not exceeding $x$, then $$\binom nk<\Big(1-\frac{5(k-[\f n5])}{6n^2}\Big) \frac{n^{n-\f 12}}{k^k(n-k)^{n-k}}.$$
Quadratically enriched binomial coefficients over a finite field
本文研究了有限域上二次富集的二项式系数，通过双线性形式扩展帕斯卡三角，并利用A^1同伦论在非代数闭域上进行曲线计数。
For $n\ge 3$ let $f(n)$ be the least positive integer $k$ such that $\binom nk>\frac{2^n}{n+1}$. In this paper we investigate the properties of $f(n)$.
In 1947 Fine obtained an expression for the number of binomial coefficients on row n of Pascal's triangle that are nonzero modulo p. In this paper we use Kummer's theorem to generalize Fine's theorem to prime powers, expressing the number of nonzero binomial coefficients modulo p^alpha as a sum over certain integer partitions. For fixed alpha, this expression can be rewritten to show explicit dependence on the number of occurrences of each subword in the base-p representation of n.
Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be computed in $O(n^2)$, and the q-binomial coefficient can be computed in $O(n^3)$. Using the definition of the q-binomial coefficient, some properties of the q-binomial coefficient and $P(n,m,p)$ are derived. The q-multinomial coefficient can be computed as a product of q-binomial coefficients. A formula for $Q(n,m,p)$, the number of integer partitions of $n$ into e…
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.
Binomial coefficients coprime to 6
本文针对d含至少两个不同素因子时无有意义界的问题，首次给出与6互素的二项式系数数量的非平凡界，推进了例外集合规模的研究。
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 prove the following identity $$ \lcm({n\brack 0}_q,{n\brack 1}_q,...,{n\brack n}_q) =\frac{\lcm([1]_q,[2]_q,...,[n+1]_q)}{[n+1]_q}, $$ where ${n\brack k}_q$ denotes the $q$-binomial coefficient and $[n]_q=\frac{1-q^n}{1-q}$. This result is a $q$-analogue of an identity of Farhi [Amer. Math. Monthly, November (2009)].
We construct multiple $qt$-binomial coefficients and related multiple analogues of several celebrated families of special numbers in this paper. These multidimensional generalizations include the first and the second kind of $qt$-Stirling numbers, $qt$-Bell numbers, $qt$-Bernoulli numbers, $qt$-Catalan numbers and the $qt$--Fibonacci numbers. In the course of developing main properties of these extensions, we prove results that are significant in their own rights such as certain probability measures on the set of integer partitions.
Every binomial coefficient aficionado knows that the greatest common divisor of the binomial coefficients $\binom n1,\binom n2,\dots,\binom n{n-1}$ equals $p$ if $n=p^i$ for some $i>0$ and equals 1 otherwise. It is less well known that the greatest common divisor of the binomial coefficients $\binom{2n}2,\binom{2n}4,\dots,\binom{2n}{2n-2}$ equals (a certain power of 2 times) the product of all odd primes $p$ such that $2n=p^i+p^j$ for some $0\le i\le j$. This note gives a concise proof of a tidy generalization of these facts.
In this paper we obtain some congruences involving central binomial coefficients and Lucas sequences. For example, we show that if p>5 is a prime then $\sum_{k=0}^{p-1}F_k*binom(2k,k)/12^k$ is congruent to 0,1,-1 modulo p according as p=1,4 (mod 5), p=13,17 (mod 30), and p=7,23 (mod 30) respectively, where {F_n} is the Fibonacci sequence. We also raise several conjectures.
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.
The q-binomial coefficients are the polynomial cousins of the traditional binomial coefficients, and a number of identities for binomial coefficients can be translated into this polynomial setting. For instance, the familiar vanishing of the alternating sum across row n of Pascal's triangle is captured by the so-called Gaussian Formula. In this paper, we find a q-binomial congruence which synthesizes this result and Fleck's congruence for binomial coefficients.
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.
Three combinatorial sums involving central binomial coefficients
本文研究三类含中心二项式系数及不同调和数的组合和，通过分部求和建立递归式，并用第二类 Stirling 数与 r-Stirling 数给出闭合形式。
We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of the author, they are used to establish modulo $p^k$ ($k>1$) congruences between truncated generalized hypergeometric series, and a function which extends Greene's hypergeometric function over finite fields to the $p$-adic setting. A specialization of one of these congruences is used to prove an outstanding conjecture of Rodriguez-Villegas which relates a trun…
Series Associated with Harmonic Numbers, Fibonacci Numbers and Central Binomial Coefficients $\binom{2n}{n}$
本文通过直接变换而非传统超几何方法，发现了涉及中心二项式系数、调和数与斐波那契数的多种级数，并给出了 $\zeta(2)$ 的新级数表示。
Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let $p>3$ be a prime. We show that $$T_{p-1}\equiv\left(\frac p3\right)3^{p-1}\ \pmod{p^2},$$ where the central trinomial coefficient $T_n$ is the constant term in the expansion of $(1+x+x^{-1})^n$. We also prove three congruences modulo $p^3$ conjectured by Sun, one of which is $$\sum_{k=0}^{p-1}\binom{p-1}k\binom{2k}k((-1)^k-(-3)^{-k})\equiv \left(\frac p3\right)(3^{p-1}-1)\ \pmod{p^3}.$$ In addition, we get some new combinatorial identities.
It is well known that for all $n\geq1$ the number $n+ 1$ is a divisor of the central binomial coefficient ${2n\choose n}$. Since the $n$th central binomial coefficient equals the number of lattice paths from $(0,0)$ to $(n,n)$ by unit steps north or east, a natural question is whether there is a way to partition these paths into sets of $n+ 1$ paths or $n+1$ equinumerous sets of paths. The Chung-Feller theorem gives an elegant answer to this question. We pose and deliver an answer to the analogous question for $2n-1$, another divisor of ${2n\choose n}$. We then show our main result follows fro…
Explicit Identities and new results for Infinite Series associated with the Ratio of Central Binomial Coefficients
研究中心二项式系数比值相关的无穷级数，推导新的显式恒等式和闭式求值，改进先前结果。
Let $p>3$ be a prime. In this paper, we obtain the congruences for $$\sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^3}{(-8)^k},\ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{3k}k}{(-192)^k},\ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{4k}{2k}}{(-144)^k}\ \text{and} \ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{4k}{2k}}{648^k}$$ modulo $p^2$, and partial results for $\sum_{k=0}^{(p-1)/2} \binom{2k}k^3\frac{w(k)}{m^k}$ modulo $p^2$, where $m\in\{1,16,-64,256,-512,4096\}$ and $w(k)\in\{k^2,k^3,\frac 1{k+1},\frac 1{(k+1)^2},\frac 1{(k+1)^3}, \frac 1{2k-1},\frac 1{k+2}\}$.
We extend the digital binomial identity as given by Nguyen el al. to an identity in an arbitrary base $b$, by introducing the $b-$ary binomial coefficients. We then study the properties of these coefficients such as orthogonality, a link to Lucas' theorem and the corresponding $b-$ary Pascal triangles.
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…
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.
An identity relating $n$-nacci numbers, partitions, and products of binomial coefficients
本文通过研究最终类型和其相关划分，推导出n-nacci数的恒等式，并比较了不同偏序关系。
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…
In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Apéry-like numbers.
Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete system of residues modulo any power of p.
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 examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.
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.
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.
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.
A generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$ with $b,c\in\mathbb Z$. In this paper we investigate congruences and series for sums of terms related to central binomial coefficients and generalized central trinomial coefficients. The paper contains many conjectures on congruences related to representations of primes by certain binary quadratic forms, and 62 proposed new series for $1/π$ motivated by congruences and related dualities.
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.
We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。