English
Related papers

Related papers: Congruences for an arithmetic function from 3-colo…

200 papers

Let q be an odd positive integer and P \in F2[z] be of order q and such that P(0) = 1. We denote by A = A(P) the unique set of positive integers satisfying \sum_{n=0}^\infty p(A, n) z^n \equiv P(z) (mod 2), where p(A,n) is the number of…

Number Theory · Mathematics 2012-05-08 Fethi Ben Said , Jean-Louis Nicolas

We study frequency moments of partition statistics arising from Euler products $A(q)=\prod_{r\ge1}(1-q^r)^{-c(r)}$ via a transform that expresses the moment generating functions as $B(q)$ times explicit divisor--sum series determined by…

Number Theory · Mathematics 2026-02-11 Hartosh Singh Bal

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

Number Theory · Mathematics 2007-07-25 Zhi-Wei Sun , Donald M. Davis

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

For the partition function $p(n)$, Ramanujan proved the striking identities $$ P_5(q):=\sum_{n\geq 0} p(5n+4)q^n =5\prod_{n\geq 1} \frac{\left(q^5;q^5\right)_{\infty}^5}{(q;q)_{\infty}^6}, $$ $$ P_7(q):=\sum_{n\geq 0} p(7n+5)q^n…

Number Theory · Mathematics 2025-10-08 Kathrin Bringmann , William Craig , Ken Ono

In this paper we establish some new supercongruences motivated by the well-known fact $\lim_{n\to\infty}(1+1/n)^n=e$. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{-1/(p+1)}k^{p+1}\equiv 0\ \pmod{p^5}\ \ \ \mbox{and}\ \ \…

Number Theory · Mathematics 2015-02-27 Zhi-Wei Sun

We study the asymptotic representation for the zeros of the deformed exponential function $\sum\nolimits_{n = 0}^\infty {\frac1{n!}{q^{n(n - 1)/2}{x^n}}} $, $q\in (0,1)$. Indeed, we obtain an asymptotic formula for these zeros: \[x_n=-…

Classical Analysis and ODEs · Mathematics 2016-04-29 Cheng Zhang

A conjecture of Borwein asserts that for any positive integers $n$ and $k$, the coefficient $a_{3k}$ of $q^{3k}$ in the expansion of $\prod_{j=0}^n (1-q^{3j+1})(1-q^{3j+2})$ is nonnegative. In this paper we prove that for any $0 \leq k\leq…

Combinatorics · Mathematics 2020-01-01 Jiyou Li

In his 1984 Memoir of the American Mathematical Society, George Andrews defined two families of functions, $\phi_k(n)$ and $c\phi_k(n),$ which enumerate two types of combinatorial objects which Andrews called generalized Frobenius…

Number Theory · Mathematics 2024-05-30 George E. Andrews , James A. Sellers , Fares Soufan

Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…

Number Theory · Mathematics 2022-07-20 Scott Ahlgren , Patrick B. Allen , Shiang Tang

The study of arithmetic properties of coefficients of modular forms $f(\tau) = \sum a(n)q^n$ has a rich history, including deep results regarding congruences in arithmetic progressions. Recently, work of C.-S. Radu, S. Ahlgren, B. Kim, N.…

Number Theory · Mathematics 2019-10-17 Sharon Garthwaite , Marie Jameson

The Franel numbers are defined by $ f_n=\sum_{k=0}^n {n\choose k}^3. $ Motivated by the recent work of Z.-W. Sun on Franel numbers, we prove that \begin{align*} \sum_{k=0}^{n-1}(3k+1)(-16)^{n-k-1} {2k\choose k} f_k &\equiv…

Number Theory · Mathematics 2014-04-29 Victor J. W. Guo

The Franel numbers given by $f_n=\sum_{k=0}^n\binom{n}{k}^3$ ($n=0,1,2,\ldots$) play important roles in both combinatorics and number theory. In this paper we initiate the systematic investigation of fundamental congruences for the Franel…

Number Theory · Mathematics 2015-03-19 Zhi-Wei Sun

Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius…

Number Theory · Mathematics 2025-09-16 Scott Ahlgren , Cruz Castillo

We show that if the congruence above holds and $n\mid m$, then the quotient $Q:=m/n$ satisfies $\sum_{p\mid Q} \frac{Q}{p}+1 \equiv 0\pmod{Q}$, where $p$ is prime. The only known solutions of the latter congruence are $Q=1$ and the eight…

Number Theory · Mathematics 2015-06-17 José María Grau , Antonio M. Oller-Marcén , Jonathan Sondow

For all positive integers n, we prove the following divisibility properties: $$(2n+3){2n\choose n} | 3{6n\choose 3n}{3n\choose n}, and (10n+3){3n\choose n} | 21{15n\choose 5n} {5n\choose n}.$$ This confirms two recent conjectures of Z.-W.…

Number Theory · Mathematics 2014-01-03 Victor J. W. Guo

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…

Combinatorics · Mathematics 2017-08-01 Victor J. W. Guo , Su-Dan Wang

Lin introduced the partition function $\text{PDO}_t(n)$, which counts the total number of tagged parts over all the partitions of $n$ with designated summands in which all parts are odd. For $k\geq0$, Lin conjectured congruences for…

Number Theory · Mathematics 2023-07-11 Gurinder Singh , Rupam Barman

Let $a_k(n)$ denote the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may be ``colored" with one of $k$ colors, for fixed $k$. In this note, we find some congruences for $a_k(n)$ in the spirit of…

Number Theory · Mathematics 2026-01-21 Anjelin Mariya Johnson , James A. Sellers , S. N. Fathima

It is well-known that the congruence $\sum_{i=1}^{ n} i^{ n} \equiv 1 \pmod{n}$ has exactly five solutions: $\{1,2,6,42,1806\}$. In this work, we characterize the solutions to the congruence $1^n + 2^n + \dotsb + n^n\equiv p \pmod{n}$ for…

Number Theory · Mathematics 2020-09-15 Max Alekseyev , Jose Maria Grau , Amtonio Oller-Marcen