Related papers: Some New Congruences for $\ell$-Regular Multiparti…

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…

For a given prime $p$, we study the properties of the $p$-dissection identities of Ramanujan's theta functions $\psi(q)$ and $f(-q)$, respectively. Then as applications, we find many infinite family of congruences modulo 2 for some…

It is shown that for any prime $p$ and any natural numbers $\ell, m,$ and $s$ such that $0<s<p$, the three following congruences \begin{align*}\sum_{i\ge \ell+1}(-1)^{m-i} {m \choose i}{m+s-1+i(p-1) \choose m+s-1+\ell(p-1)} &\equiv 0 \bmod…

Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…

For coprime nonzero integers $a$ and $b$, a positive integer $\ell$ is said to be {\em good} with respect to $a$ and $b$ if there exists a positive integer $k$ such that $\ell |(a^{k}+b^{k})$. Since the early 1990s, such classical good…

We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…

For a given positive integers $m$ and $\ell$, we give a complete list of positive integers $n$ for which their exist $m$th roots of unity $x_1,\dots,x_n \in \mathbb{C}$ such that $x_1^{\ell} + \cdots + x_n^{\ell}=0$. This extends the…

A partition is said to be $\ell$-regular if none of its parts is a multiple of $\ell$. Let $b^\prime_5(n)$ denote the number of 5-regular partitions into distinct parts (equivalently, into odd parts) of $n$. This function has also close…

The nth r-extended Lah-Bell number is defined as the number of ways a set with $n+r$ elements can be partitioned into ordered blocks such that r distinguished elements have to be in distinct ordered blocks. The aim of this paper is to…

Let $d, r \in \N$, $\|\cdot\|$ any norm on $\R^d$ and $B$ denote the unit ball with respect to this norm. We show that any sequence $v_1,v_2,...$ of vectors in $B$ can be partitioned into $r$ subsequences $V_1, ..., V_r$ in a balanced…

Let $c_N(n)$ denotes the number of bipartitions $(\lambda, \mu)$ of a positive integer $n$ subject to the restriction that each part of $\mu$ is divisible by $N$. In this paper, we prove some congruence properties of the function $c_N(n)$…

In a recent paper, Jin, Liu, and Xia \cite{JLX} presented some modulo 4 congruences for $\overline{spt2}(n)$, the number of smallest parts in the overpartitions of $n$ where the smallest part is even and is not overlined. In this paper, we…

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

It is known that the ordered Bell numbers count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$. In this paper, we introduce the deranged Bell numbers that count the total number of deranged partitions of $[n]$. We first study…

We consider $cp_{a,b,m}(n)$, the number of $(a,b,m)$-copartitions of $n$. We find many infinitelymany congruencesmodulo 2 and 6 for some particular value of $a$, $b$ and $m$.

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…