Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

High order congruences for $M$-ary partitions (2403.04495v1)

Published 7 Mar 2024 in math.NT and math.CO

Abstract: For a sequence $M=(m_{i}){i=0}{\infty}$ of integers such that $m{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for every positive integer $n$ the following congruence is true: \begin{align*} p_{M}(m_{1}m_{2}\cdots m_{r}n-1)\equiv 0\ \ \left({\rm mod}\ \prod_{t=2}{r}\mathcal{M}(m_{t},t-1)\right), \end{align*} where $\mathcal{M}(m,r):=\frac{m}{\gcd\big(m,{\rm lcm} (1,\ldots ,r)\big)}$. Our result answers a conjecture posed by Folsom, Homma, Ryu and Tong, and is a generalisation of the congruence relations for $m$-ary partitions found by Andrews, Gupta, and R{\o}dseth and Sellers.

Citations (1)

Summary

We haven't generated a summary for this paper yet.