Arithmetic density and congruences of -regular bipartitions
Abstract
Let B(n) denote the number of -regular bipartitions of n. In this article, we prove that B(n) is always almost divisible by pij if pi2ai≥ , where j is a fixed positive integer and =p1a1p2a2… pmam, where pi are prime numbers ≥ 5. Further, we obtain an infinities families of congruences for B3(n) and B5(n) by using Hecke eigen form theory and a result of Newman Newmann1959. Furthermore, by applying Radu and Seller's approach, we obtain an algorithm from which we get several congruences for Bp(n), where p is a prime number.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.