中文
相关论文

相关论文: Congruences for sums of binomial coefficients

200 篇论文

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…

数论 · 数学 2009-12-20 Zhi-Wei Sun

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}}. $$

数论 · 数学 2012-06-05 Hao Pan

Let $q$ be a positive integer, $\chi$ a nontrivial character mod $q$, $\mathcal{I}$ an interval of length not exceeding $q.$ In this paper we shall study the character sum analogue of the well-known Kloosterman…

数论 · 数学 2011-12-30 Ping Xi

Let $a$ and $m>0$ be integers. We show that for any integer $b$ relatively prime to $m$, the set $\{a^n+bn:\ n=1,\ldots,m^2\}$ contains a complete system of residues modulo $m$. We also pose several conjectures for further research; for…

数论 · 数学 2014-02-28 Zhi-Wei Sun

For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements $x_1,x_2,...,x_l,y$ satisfying the congruence $x_1+\...+x_l\equiv y\bmod{m}$. It is proved that,…

In 1950 G. Giuga studied the congruence $\sum_{j=1}^{n-1} j^{n-1} \equiv -1$ (mod $n$) and conjectured that it was only satisfied by prime numbers. In this work we generalize Giuga's ideas considering, for each $k \in \mathbb{N}$, the…

数论 · 数学 2011-03-18 José María Grau , Antonio M. Oller-Marcén

For a fixed positive integer $k$, let $C(k,n)$ denote the number of two-color partitions of $n$ with odd smallest part and restrictions on even parts, and let $C_k(q)$ be its generating function. We show that $C(1,n)\equiv d(2n-1)\pmod{4}$…

数论 · 数学 2026-03-10 George E. Andrews , Mohamed El Bachraoui

In 2013, Pak and Panova proved the strict unimodality property of $q$-binomial coefficients $\binom{\ell+m}{m}_q$ (as polynomials in $q$) based on the combinatorics of Young tableaux and the semigroup property of Kronecker coefficients.…

符号计算 · 计算机科学 2023-09-04 Christoph Koutschan , Ali K. Uncu , Elaine Wong

Let A={a_s(mod n_s)}_{s=0}^k be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results concerning system A. In particular, we show that if every integer lies in…

数论 · 数学 2007-05-23 Zhi-Wei Sun

In this paper, we present several new $q$-congruences on the $q$-trinomial coefficients introduced by Andrews and Baxter. As a conclusion, we obtain the following congruence: \begin{align*}…

数论 · 数学 2023-05-03 Yifan Chen , Xiaoxia Wang

To each i, j belonging to some set of integers, attach the integer a(i,j). Are there integers x(i) such that x(j)-x(i) is congruent to a(i,j) mod (i,j)? A necessary condition is that a(i,j)+a(j,k) be congruent to a(i,k) mod (i,j,k). This…

数论 · 数学 2007-05-23 Pierre-Yves Gaillard

Let $N_k(n,r,\boldsymbol{a})$ denote the number of incongruent solutions of the quadratic congruence $a_1x_1^2+\ldots+a_kx_k^2\equiv n$ (mod $r$), where $\boldsymbol{a}=(a_1,\ldots,a_k)\in {\Bbb Z}^k$, $n\in {\Bbb Z}$, $r\in {\Bbb N}$. We…

数论 · 数学 2014-11-21 László Tóth

We give a few remarks on the periodic sequence $a_n=\binom{n}{x}~(mod~m)$ where $x,m,n\in \mathbb{N}$, which is periodic with minimal length of the period being…

数论 · 数学 2015-09-29 Alexandre Laugier , Manjil Saikia

Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on…

数论 · 数学 2020-10-05 Kam Hung Yau

Given a polynomial $Q(x_1,\cdots, x_t)=\lambda_1 x_1^{k_1}+\cdots +\lambda_t x_t^{k_t}$, for every $c\in \mathbb{Z}$ and $n\geq 2$, we study the number of solutions $N_J(Q;c,n)$ of the congruence equation $Q(x_1,\cdots, x_t)\equiv…

数论 · 数学 2017-05-23 Songsong Li , Yi Ouyang

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

组合数学 · 数学 2009-06-16 Victor Reiner , Dennis Stanton

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

数论 · 数学 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

In 2022, Z.-W. Sun defined \begin{equation*} w_k^{(\alpha)}{(x)}=\sum_{j=1}^{k}w(k,j)^{\alpha}x^{j-1}, \end{equation*} where $k,\alpha$ are positive integers and $w(k,j)=\frac{1}{j}\binom{k-1}{j-1}\binom{k+j}{j-1}$. Let $(x)_{0}=1$ and…

数论 · 数学 2025-07-08 Lin-Yue Li , Rong-Hua Wang

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} Z(p^{r})\equiv-2p^{r-1}B_{p-3} ~(\bmod ~ p^{r}), \end{equation*} where $…

数论 · 数学 2016-11-29 Tianxin Cai , Zhongyan Shen , Lirui Jia

We consider $cp_{a,b,m}(n)$, the number of $(a,b,m)$-copartitions of $n$. We find many infinitelymany congruencesmodulo 2 and 6 for some particular value of $a$, $b$ and $m$.

数论 · 数学 2023-03-27 Yudhisthira Jamudulia