English
Related papers

Related papers: Super-congruences involving trininomial coefficien…

200 papers

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

Number Theory · Mathematics 2007-08-06 Zhi-Wei Sun , Roberto Tauraso

We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…

Classical Analysis and ODEs · Mathematics 2011-05-03 Roland Groux

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 obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

Number Theory · Mathematics 2012-03-02 Jean Bourgain , Moubariz Garaev , Sergei Konyagin , Igor Shparlinski

In this paper we prove the supercongruence $$\sum_{n=0}^{(p-1)/2}\frac{6n+1}{256^n}\binom{2n}n^3\equiv p(-1)^{(p-1)/2}+(-1)^{(p-1)/2}\frac{7}{24}p^4B_{p-3}\pmod{p^5}$$ for any prime $p>3$, which was conjectured by Sun in 2019.

Number Theory · Mathematics 2021-09-22 Guo-Shuai Mao , Zhi-Wei Sun

Let $p$ be an odd prime. Define the Gaussian power sum \[ G_n(p)=\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}(a+bi)^n\in\mathbb Z[i]. \] We determine $G_p(p)$ modulo high powers of $p$: if $p\equiv 1\pmod 4$ then $$G_p(p)\equiv p^2(1+i)\pmod{p^3},$$…

General Mathematics · Mathematics 2026-02-04 Nikita Kalinin , Faith Shadow Zottor

In this paper, we confirm several conjectured congruences of Sun concerning the divisibility of binomial sums. For example, with help of a quadratic hypergeometric transformation, we prove that $$…

Number Theory · Mathematics 2019-01-28 Guo-Shuai Mao , Hao Pan

By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…

Number Theory · Mathematics 2019-02-14 Victor J. W. Guo , Wadim Zudilin

A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

We determine the p-exponent in many of the coefficients in the power series (log(1+x)/x)^t, where t is any integer. In our proof, we introduce a variant of multinomial coefficients. We also characterize the power series x/log(1+x) by…

Number Theory · Mathematics 2010-01-19 Donald M. Davis

We present some congruences modulo $p^{6-d}$ for sums of the type $\sum_{k=0}^{(p-3)/2}x^k{2k\choose k}/(2k+1)^d$, for $d=1,2,3$ where $p>5$ is a prime.

Number Theory · Mathematics 2011-11-01 Roberto Tauraso

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…

Combinatorics · Mathematics 2017-05-24 Julien Leroy , Michel Rigo , Manon Stipulanti

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

Number Theory · Mathematics 2011-08-25 Zhi-Hong Sun

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

Number Theory · Mathematics 2016-01-28 Liuquan Wang

This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…

Number Theory · Mathematics 2010-01-21 Xavier Taixes i Ventosa , Gabor Wiese

We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…

General Mathematics · Mathematics 2024-05-22 Joseph M. Shunia

We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…

Combinatorics · Mathematics 2010-04-23 Milan Janjic

In examining the relationship between the number of points over $\mathbb{F}_p$ on certain Calabi-Yau manifolds and hypergeometric series which correspond to a particular period of the manifold, Rodriguez-Villegas identified 22 possible…

Number Theory · Mathematics 2009-07-30 Dermot McCarthy

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

Number Theory · Mathematics 2019-02-20 Igor E. Shparlinski

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

Machine Learning · Statistics 2012-03-27 Péter Kövesárki