arXiv subjects

Ahaan Kallat

Publications and source records attributed to Ahaan Kallat.

2 recordsLinked to original sources

arXiv2026

A Proof of Bala's Congruence Conjectures for A158690

Let $a(n)$ be the sequence A158690 in the On-Line Encyclopedia of Integer Sequences (OEIS), defined by the exponential generating function $\sum_{n\ge0} a(n)t^n/n! = 1+\sum_{m\ge1}\prod_{j=1}^m(1-e^{-(2j-1)t})$. We prove two congruence conjectures of Peter Bala. The first states that, for every integer $k\ge1$, the sequence $a(n)$ modulo $k$ is eventually periodic with period dividing $φ(k)$. We prove the stronger statement that the Carmichael function $λ(k)$ is an eventual period. The second conjecture asserts the shifted Gauss congruences $a(np^r+i)\equiv a(np^{r-1}+i)\pmod{p^r}$ for every $i\ge0$, every prime $p$, and all $n,r\ge1$. Both results follow from a general theorem for exponential generating functions of the form $G(e^t-1)$ with $G\in\mathbb Z[[y]]$, together with the standard power-sum formula for Stirling numbers of the second kind.

math.NT↗

arXiv2026

A Proof of Bala's Congruence Conjecture for A028342

Let $a(n)$ be the sequence A028342 in the On-Line Encyclopedia of Integer Sequences (OEIS), defined by the exponential generating function $\sum_{n\ge0} a(n)x^n/n! = \prod_{i\ge1}(1-x^i)^{-1/i}$. Equivalently, $a(n)$ counts permutations of an $n$-element labeled set in which every cycle is assigned one divisor of its length, where a cycle of length $m$ has $d(m)$ choices, $d(m)$ being the number of positive divisors of $m$. We prove a family of congruences for $a$, conjectured by Peter Bala. They state that $k \mid a(n+k)+a(n)$ for odd $k$, that $k \mid a(n+k)-a(n)$ for $k\equiv 0,2,6 \pmod 8$, and that $k \mid 2(a(n+k)-a(n))$ for $k\equiv 4\pmod 8$. The proof first establishes a product congruence $a(n+k)\equiv a(n)a(k)\pmod k$, and then computes $a(p^r)\bmod p^r$ for each prime power by counting the colored permutations fixed by a subgroup of order $p$.

math.CO↗