EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Arithmetic of General Partition Functions $p_r(n)$ Modulo Primes

B. R. Srivatsa Kumar, H. S. Manu Banakar, R. G. Veeresha

Boletim da Sociedade Paranaense de Matemática · 12.03.2026 · 44 (9) · 1-6

DOI: 10.5269/bspm.79799 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 12.03.2026. Verfasst von B. R. Srivatsa Kumar und 2 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In the present investigation, we establish several new infinite families of congruences for the generalized partition function $p_r(n)$. Our emphasis throughout this paper is on demonstrating how classical and modern $q$-identities can be effectively employed to derive these congruences. By systematically applying these identities, we uncover congruences modulo primes such as 19, 23 and 29, valid for all positive integers $\lambda$. This approach not only yields elegant arithmetic results but also highlights the deep interplay between partition theory and the analytic properties of $q$-series.

Zitieren

APA

Kumar, B. R. S., Banakar, H. S. M., & Veeresha, R. G. (2026). Arithmetic of General Partition Functions $p_r(n)$ Modulo Primes. Boletim da Sociedade Paranaense de Matemática, 44(9), 1-6. https://doi.org/10.5269/bspm.79799

Vancouver

Kumar BRS, Banakar HSM, Veeresha RG. Arithmetic of General Partition Functions $p_r(n)$ Modulo Primes. Boletim da Sociedade Paranaense de Matemática. 2026;44(9):1-6. doi:10.5269/bspm.79799

BibTeX
@article{Kumar2026,
  author = {Kumar, B. R. Srivatsa and Banakar, H. S. Manu and Veeresha, R. G.},
  title = {Arithmetic of General Partition Functions $p_r(n)$ Modulo Primes},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2026},
  volume = {44},
  number = {9},
  pages = {1--6},
  doi = {10.5269/bspm.79799}
}
Kostenlos starten →