English
Related papers

Related papers: Congruences involving binomial coefficients and Lu…

200 papers

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

We prove that if the signed binomial coefficient $(-1)^i\binom{k}{i}$ viewed modulo p is a periodic function of i with period h prime to p in the range $0\le i\le k$, then k+1 is a power of p, provided h is not too large compared to k. (In…

Number Theory · Mathematics 2007-05-23 Sandro Mattarei

A classical result of A. Fleck states that if p is a prime, and n>0 and r are integers, then $$\sum_{k=r(mod p)}\binom {n}{k}(-1)^k=0 (mod p^{[(n-1)/(p-1)]}).$$ Recently R. M. Wilson used Fleck's congruence and Weisman's extension to…

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

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.

Number Theory · Mathematics 2021-12-02 Kunle Adegoke

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…

Combinatorics · Mathematics 2026-04-24 Nick Vorobtsov

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…

Number Theory · Mathematics 2010-12-22 Zhi-Wei Sun

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the…

Combinatorics · Mathematics 2007-05-23 Rhodes Peele , Pantelimon Stanica

We show various supercongruences for truncated series which involve central binomial coefficients and harmonic numbers. The corresponding infinite series are also evaluated.

Number Theory · Mathematics 2017-01-31 Roberto Tauraso

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2014-06-25 Tewodros Amdeberhan

In this work we consider the congruence $\sum_{j=1}^{n-1} j^{k(n-1)} \equiv -1 \pmod n$ for each $k \in \mathbb{N}$, thus extending Giuga's ideas for $k=1$. In particular, it is proved that a pair $(n,k)\in \mathbb{N}^2$ satisfies this…

Number Theory · Mathematics 2013-11-15 Antonio M. Oller-Marcén , José María Grau

This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…

Number Theory · Mathematics 2013-10-11 Joel Beeren , David Harvey , Tim Trudgian

For a given prime $p$, we determine the limit, as $\lambda \to \infty$, of the density of residues modulo $p^\lambda$ attained by the Fibonacci sequence. In particular, we show that this limiting density is related to zeros in the sequence…

Number Theory · Mathematics 2025-08-26 Nicholas Bragman , Eric Rowland

Let $t\in\mathbb{N}_+$ be given. In this article we are interested in characterizing those $d\in\mathbb{N}_+$ such that the congruence $$\frac{1}{t}\sum_{s=0}^{t-1}{n+d\zeta_t^s\choose d-1}\equiv {n\choose d-1}\pmod{d}$$ is true for each…

Number Theory · Mathematics 2022-03-08 Piotr Miska

For various positive integers $k$, the sums of $k$th powers of the first $n$ positive integers, $S_k(n+1)=1^k+2^k+...+n^k$, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each $k\ge 2 $$…

Number Theory · Mathematics 2018-04-12 Romeo Meštrović

We prove some polynomial identities from which we deduce congruences modulo $p^2$ for the Fermat quotient $\frac{2^p-2}{p}$ for any odd prime $p$ (Proposition 1 and Theorem 1). These congruences are simpler than the one obtained by…

Number Theory · Mathematics 2023-09-19 Takao Komatsu , B. Sury

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

Number Theory · Mathematics 2016-04-06 J. Cilleruelo , M. Z. Garaev

In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…

Number Theory · Mathematics 2016-01-19 Nazmiye Yilmaz , Yasin Yazlik , Necati Taskara

In this paper, we mainly prove two congruence conjecture of Z.-W. Sun. Let $p\equiv3\pmod 4$ be a prime. Then $$\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{8^k}\equiv-\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{(-16)^k}\pmod{p^3}.$$ And for any odd prime…

Number Theory · Mathematics 2023-04-11 Guo-Shuai Mao

We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…

Combinatorics · Mathematics 2007-05-23 Emeric Deutsch , Bruce E. Sagan