Related papers: Parity of 4-regular and 8-regular partition functi…
One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…
For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. Motivated by some recent conjectures of Keith and Zanello, we establish infinite families of congruences modulo $2$…
In recent work, Amdeberhan and Merca considered the integer partition function $a(n)$ which counts the number of integer partitions of weight $n$ wherein even parts come in only one color (i.e., they are monochromatic), while the odd parts…
Let $B_{u,v}(n)$ denote the number of $(u,v)$-regular bipartitions of $n$. In this article, we prove that $B_{p,m}(n)$ is always almost divisible by $p,$ where $p\geq 5$ is a prime number and $m=p_1^{\alpha_1} p_2^{\alpha_2}\cdots…
A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…
Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…
In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…
The main result of the paper is the existence of an infinitely many families of Ramanujan-type congruences for $b_4(n)$ and $b_6(n)$ modulo primes $m \geq 2$ and $m \geq 5$, respectively. We provide new examples of congruences for $b_4(n)$…
Let $p_{-t}(n)$ denote the number of partitions of $n$ into $t$ colors. In analogy with Ramanujan's work on the partition function, Lin recently proved in \cite{Lin} that $p_{-3}(11n+7)\equiv0\pmod{11}$ for every integer $n$. Such…
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…
Inspired by the recent work by Nadji, Ahmia and Ram\'irez, we examined the arithmetic properties of $\bar{B}_{l_1,l_2} (n)$, the number of overpartitions of n whose parts are neither divisible by $l_1$ nor divisible by $l_2$. In particular,…
Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23…
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…
We improve S.-C. Chen's result on the parity of Schur's partition function. Let $A(n)$ be the number of Schur's partitions of $n$, i.e., the number of partitions of $n$ into distinct parts congruent to $1, 2 \mod{3}$. S.-C. Chen…
Let $ B_{\ell}(n)$ denote the number of $\ell$-regular bipartitions of $n.$ In this article, we prove that $ B_{\ell}(n)$ is always almost divisible by $p_i^j$ if $p_i^{2a_i}\geq \ell,$ where $j$ is a fixed positive integer and…
The expression $a^n + b^n$ can be factored as $(a+b)(a^{n-1} - a^{n-2} b + a^{n-3} b^2 - ... + b^{n-1})$ when $n$ is an odd integer greater than one. This paper focuses on proving a few properties of the longer factor above, which we call…
We show that for any natural number $n$ satisfying $n\equiv 4 \mod 8$ and $n\not\equiv 0 \mod 5$, and for any odd integer $t\geq \frac{n+6}{2}$ there are infinitely many Salem numbers ${\alpha}$ of degree $2t$ such that ${\alpha}^n-1$ is a…
In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…
We prove that if A is a subset of the primes, and the lower density of A in the primes is larger than 1/2, then every sufficiently large even integer can be written as the sum of eight primes from A. The constant 1/2 in this statement is…
In this paper, we investigate the arithmetic properties of the difference between the number of partitions of a positive integer $n$ with even crank and those with odd crank, denoted $C(n)=c_e(n)-c_o(n)$. Inspired by Ramanujan's classical…