ﻻ يوجد ملخص باللغة العربية
Let $p_{-k}(n)$ enumerate the number of $k$-colored partitions of $n$. In this paper, we establish some infinite families of congruences modulo 25 for $k$-colored partitions. Furthermore, we prove some infinite families of Ramanujan-type congruences modulo powers of 5 for $p_{-k}(n)$ with $k=2, 6$, and $7$. For example, for all integers $ngeq0$ and $alphageq1$, we prove that begin{align*} p_{-2}left(5^{2alpha-1}n+dfrac{7times5^{2alpha-1}+1}{12}right) &equiv0pmod{5^{alpha}} end{align*} and begin{align*} p_{-2}left(5^{2alpha}n+dfrac{11times5^{2alpha}+1}{12}right) &equiv0pmod{5^{alpha+1}}. end{align*}
Let $Delta_{k}(n)$ denote the number of $k$-broken diamond partitions of $n$. Quite recently, the second author proved an infinite family of congruences modulo 25 for $Delta_{k}(n)$ with the help of modular forms. In this paper, we aim to provide an elementary proof of this result.
Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for $p_{k,3}(n)$ wi
The notion of broken $k$-diamond partitions was introduced by Andrews and Paule. Let $Delta_{k}(n)$ denote the number of broken $k$-diamond partitions of $n$ for a fixed positive integer $k$. In this paper, we establish new infinite families of broken $k$-diamond partition congruences.
A generalized crank ($k$-crank) for $k$-colored partitions is introduced. Following the work of Andrews-Lewis and Ji-Zhao, we derive two results for this newly defined $k$-crank. Namely, we first obtain some inequalities between the $k$-crank counts
Let $mge 2$ be a fixed positive integer. Suppose that $m^j leq n< m^{j+1}$ is a positive integer for some $jge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this paper, we show t