English
Related papers

Related papers: Modular periodicity of binomial coefficients

200 papers

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Number Theory · Mathematics 2009-11-06 Roberto Tauraso

We investigate when the sequence of binomial coefficients \binom{k}{i} modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0\le i\le k. In particular, we prove…

Number Theory · Mathematics 2008-04-22 Sandro Mattarei

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.

Number Theory · Mathematics 2009-12-20 Roberto Tauraso

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Number Theory · Mathematics 2013-10-09 Sandro Mattarei , Roberto Tauraso

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

Number Theory · Mathematics 2010-04-02 Zhi-Wei Sun , Roberto Tauraso

Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…

Number Theory · Mathematics 2009-09-28 Zhi-Wei Sun

Let $m$ and $n>0$ be integers. Suppose that $p$ is a prime dividing $m-4$ but not dividing $m$. We show that $\nu_p(\sum_{k=0}^{n-1}\frac{\binom{2k}k}{m^k})$ and $\nu_p(\sum_{k=0}^{n-1}\binom{n-1}{k}(-1)^k\frac{\binom{2k}k}{m^k})$ are at…

Number Theory · Mathematics 2011-04-14 Zhi-Wei Sun

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

Number Theory · Mathematics 2024-09-04 Fernando Szechtman

Let $p>3$ be a prime. For any $p$-adic integer $a$, we determine $$\sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k,\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k^{(2)},\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}k\frac{H_k^{(2)}}{2k+1}$$ modulo…

Number Theory · Mathematics 2024-01-11 Zhi-Wei Sun

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

Number Theory · Mathematics 2018-01-08 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala

Let $k\in\mathbb{N}$. Let $f(x)\in \Bbb{Z}[x]$ be any polynomial such that $f(x)$ and $f(x+1)f(x+2)... f(x+k)$ are coprime in $\mathbb{Q}[x]$. We call $$g_{k,f}(n):=\frac{|f(n)f(n+1)... f(n+k)|}{\text{lcm}(f(n),f(n+1),...,f(n+k))}$$ a Farhi…

Number Theory · Mathematics 2009-05-03 Qing-Zhong Ji , Chun-Gang Ji

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

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…

Number Theory · Mathematics 2011-01-26 Zhi-Wei Sun , Wei Zhang

Let p be an odd prime and let a be a positive integer. In this paper we investigate the sum $\sum_{k=0}^{p^a-1}\binom{hp^a-1}{k}\binom{2k}{k}/m^k$ mod p^2, where h,m are p-adic integers with m\not=0 (mod p). For example, we show that if…

Number Theory · Mathematics 2010-06-16 Zhi-Wei Sun

In this paper we deduce some new supercongruences modulo powers of a prime $p>3$. Let $d\in\{0,1,\ldots,(p-1)/2\}$. We show that $$\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k\binom{2k}{k+d}}{8^k}\equiv 0\ (\mbox{mod}\ p)\ \ \ \mbox{if}\ d\equiv…

Number Theory · Mathematics 2013-10-31 Zhi-Wei Sun

For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…

Commutative Algebra · Mathematics 2007-06-13 R. J. Shank , D. L. Wehlau

An FI-module $V$ over a commutative ring $\bf{k}$ encodes a sequence $(V_n)_{n \geq 0}$ of representations of the symmetric groups $(\mathfrak{S}_n)_{n \geq 0}$ over $\bf{k}$. In this paper, we show that for a "finitely generated" FI-module…

Representation Theory · Mathematics 2015-05-19 Rohit Nagpal

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…

Number Theory · Mathematics 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open…

Number Theory · Mathematics 2024-08-14 Hsien-Kuei Hwang , Svante Janson , Tsung-Hsi Tsai
‹ Prev 1 2 3 10 Next ›