English
Related papers

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

200 papers

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

Number Theory · Mathematics 2019-01-09 James Mc Laughlin

For a fixed positive integer $k$, let $C(k,n)$ denote the number of two-color partitions of $n$ with odd smallest part and restrictions on even parts, and let $C_k(q)$ be its generating function. We show that $C(1,n)\equiv d(2n-1)\pmod{4}$…

Number Theory · Mathematics 2026-03-10 George E. Andrews , Mohamed El Bachraoui

Let $p$ be an odd prime, Jianqiang Zhao has established a curious congruence, which is $$ \sum_{i+j+k=p \atop i,j,k > 0} \frac{1}{ijk} \equiv -2B_{p-3}\pmod p , $$ where $B_{n}$ denotes the $n$-th Bernoulli number. In this paper, we will…

Number Theory · Mathematics 2025-12-03 Jiaqi Wang , Rong Ma

Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of $n$ with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD(3n+2) is…

Combinatorics · Mathematics 2012-08-13 William Y. C. Chen , Kathy Q. Ji , Hai-Tao Jin , Erin Y. Y. Shen

Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equiv\l(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol,…

Number Theory · Mathematics 2018-09-25 Guo-Shuai Mao , Zhi-Wei Sun

It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…

Combinatorics · Mathematics 2013-06-07 William J. Keith

Let $\{A'_n\}$ be the Ap\'ery numbers given by $A'_n=\sum_{k=0}^n\binom nk^2\binom{n+k}k.$ For any prime $p\equiv 3\pmod 4$ we show that $A'_{\frac{p-1}2}\equiv \frac{p^2}3\binom{\frac{p-3}2}{\frac{p-3}4}^{-2}\pmod {p^3}$. Let $\{t_n\}$ be…

Number Theory · Mathematics 2024-10-16 Zhi-Hong Sun

We write the Lagrangian of the general N=5 three-dimensional superconformal Chern-Simons theory, based on a basic Lie superalgebra, in terms of our recently introduced N=5 three-algebras. These include N=6 and N=8 three-algebras as special…

High Energy Physics - Theory · Physics 2011-07-12 Jakob Palmkvist

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…

Number Theory · Mathematics 2023-06-16 Carlo Sanna

The starting point for this work is the family of functions $\overline{p}_{-t}(n)$ which counts the number of $t$--colored overpartitions of $n.$ In recent years, several infinite families of congruences satisfied by $\overline{p}_{-t}(n)$…

Number Theory · Mathematics 2024-05-30 James A. Sellers

We prove that, if $x$ and $q\leqslant x^{1/16}$ are two parameters, then for any invertible residue class $a$ modulo $q$ there exists a product of exactly three primes, each one below $x^{1/3}$, that is congruent to $a$ modulo $q$.

Number Theory · Mathematics 2019-03-04 Olivier Ramaré , Aled Walker

For fixed integers p and q, let f(n,p,q) denote the minimum number of colors needed to color all of the edges of the complete graph K_n such that no clique of p vertices spans fewer than q distinct colors. A construction is given which…

Combinatorics · Mathematics 2017-04-07 Alex Cameron

Recently, Shen (2016) and Alanazi et al. (2016) studied the arithmetic properties of the $\ell$-regular overpartition function $\overline{A}_\ell (n)$, which counts the number of overpartitions of $n$ into parts not divisible by $\ell$. In…

Number Theory · Mathematics 2017-06-12 Shane Chern

The 2-color partitions may be considered as an extension of regular partitions of a natural number $n$, with $p_{k}(n)$ defined as the number of 2-colored partitions of $n$ where one of the 2 colors appears only in parts that are multiples…

Number Theory · Mathematics 2018-01-30 Suparno Ghoshal , Sourav Sen Gupta

For any positive integers $n$ and $r$, let $p_r(n)$ denotes the number of partitions of $n$ where each part has $r$ distinct colours. Many authors studied the partition function $p_r(n)$ for particular values of $r$. In this paper, we prove…

Number Theory · Mathematics 2020-08-17 Nipen Saikia , Chayanika Boruah

While solving a special case of a question of Erd\H{o}s and Graham Steinerberger asks for all integers $n$ with $\phi(n)=\frac{2}{3} \cdot (n+1)$. He discovered the solutions $n\in\{5, 5 \cdot 7, 5\cdot 7\cdot 37, 5\cdot 7\cdot 37\cdot…

Number Theory · Mathematics 2025-04-29 Christian Hercher

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

Number Theory · Mathematics 2025-08-11 James A. Sellers

In this work we prove that certain entire $q$-functions have infinitely many nonzero roots $\left\{ \rho_{n}\right\} _{n=1}^{\infty}$, as $n\to+\infty$ the moduli $\left|\rho_{n}\right|$ grow at least exponentially. Applications to entire…

Complex Variables · Mathematics 2024-01-31 Ruiming Zhang

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

In this work, we investigate internal congruences modulo arbitrary powers of $3$ for two functions arising from Ramanujan's classical theta functions $\varphi(q)$ and $\psi(q)$. By letting \begin{align*} \sum_{n\ge 0} ph_3(n)…

Number Theory · Mathematics 2023-09-14 Shane Chern , Dazhao Tang