English
Related papers

Related papers: Congruences for Fishburn numbers modulo prime powe…

200 papers

Recently Lachterman, Schayer, and Younger published an elegant proof of the Ramanujan congruences for the partition function $p(n)$. Their proof uses only the classical theory of modular forms as well as a beautiful result of Choie, Kohnen,…

Number Theory · Mathematics 2016-01-21 Oleg Lazarev , Matthew S. Mizuhara , Benjamin Reid , Holly Swisher

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

Rings and Algebras · Mathematics 2016-10-31 József Vass

Let $\epsilon$ be a fixed positive quantity, $m$ be a large integer, $x_j$ denote integer variables. We prove that for any positive integers $N_1,N_2,N_3$ with $N_1N_2N_3>m^{1+\epsilon},$ the set $$ \{x_1x_2x_3 \pmod m: \quad x_j\in [1,N_j]…

Number Theory · Mathematics 2008-08-11 M. Z. Garaev

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…

Number Theory · Mathematics 2021-04-07 James Maynard

We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information about the spacings between quadratic nonresidues modulo p.…

Number Theory · Mathematics 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{11}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}.\] In this paper, we prove infinite families of…

Number Theory · Mathematics 2019-06-04 Shashika Petta Mestrige

We prove several results which imply the following consequences. For any $\varepsilon>0$ and any sufficiently large prime $p$, if $\cI_1,\ldots, \cI_{13}$ are intervals of cardinalities $|\cI_j|>p^{1/4+\varepsilon}$ and $abc\not\equiv…

Number Theory · Mathematics 2017-01-26 M. Z. Garaev

J.P. Serre showed that for any integer $m,~a(n)\equiv 0 \pmod m$ for almost all $n,$ where $a(n)$ is the $n^{\text{th}}$ Fourier coefficient of any modular form with rational coefficients. In this article, we consider a certain class of…

Number Theory · Mathematics 2024-04-05 Subham Bhakta , S. Krishnamoorthy , R. Muneeswaran

A family of formal power series, such that its coefficients satisfy a recursion formula, is characterized in terms of the summability, in the sense of J. P. Ramis, of its elements along certain well chosen directions. We describe a set of…

Complex Variables · Mathematics 2022-04-13 A. Lastra , J. Sanz , J. R. Sendra

The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…

Number Theory · Mathematics 2022-06-10 F. Javier de Vega

The Fibonacci sequence is periodic modulo every positive integer $m>1$, and perhaps more surprisingly, each period has exactly 1, 2, or 4 zeros that are evenly spaced, which also holds true for more general $K$-Fibonacci sequences. This…

Number Theory · Mathematics 2025-02-03 Brennan Benfield , Oliver Lippard

Let $p$ be a prime. In this paper, we present a detailed $p$-adic analysis to factorials and double factorials and their congruences. We give good bounds for the $p$-adic sizes of the coefficients of the divided universal Bernoulli number…

Number Theory · Mathematics 2013-08-23 Shaofang Hong , Jianrong Zhao , Wei Zhao

A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main ingredients in several known proofs. Then we give an…

Number Theory · Mathematics 2011-03-23 Kieren MacMillan , Jonathan Sondow

Given a $p$-group $G$ and a subgroup-closed class $\mathfrak{X}$, we associate with each $\mathfrak{X}$-subgroup $H$ certain quantities which count $\mathfrak{X}$-subgroups containing $H$ subject to further properties. We show in Theorem I…

Group Theory · Mathematics 2023-06-01 Stefanos Aivazidis , Maria Loukaki

We give congruences modulo powers of 2 for the Fourier coefficients of certain level 2 modular functions with poles only at 0, answering a question posed by Andersen and the first author. The congruences involve a modulus that depends on…

Number Theory · Mathematics 2017-10-02 Paul Jenkins , Ryan Keck , Eric Moss

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

Number Theory · Mathematics 2014-10-21 William D. Banks , Tristan Freiberg , Caroline L. Turnage-Butterbaugh

Let $p_{\{3, 3\}}(n)$ denote the number of $3$-regular partitions in three colours. In a very recent paper, da Silva and Sellers studied certain arithmetic properties of $p_{\{3, 3\}}(n)$. They further conjectured four Ramanujan-like…

Number Theory · Mathematics 2021-10-28 Ajit Singh , Rupam Barman

In his striking 1995 paper, Borcherds found an infinite product expansion for certain modular forms with CM divisors. In particular, this applies to the Hilbert class polynomial of discriminant $-d$ evaluated at the modular $j$-function.…

Number Theory · Mathematics 2014-07-07 Keenan Monks , Sarah Peluse , Lynnelle Ye

We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke,…

Number Theory · Mathematics 2020-09-09 Ilya D. Shkredov , Igor E. Shparlinski , Alexandru Zaharescu

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