Some methods for finding the number of partitions of n with m−parts, P(n, m)
Turkish Journal of Mathematics · 14.01.2026 · 50 (1) · 23-39
DOI: 10.55730/1300-0098.3633 ↗Kurz gefasst
Fachartikel in der Zeitschrift Turkish Journal of Mathematics, online erschienen am 14.01.2026. Verfasst von YUSUF SOYVURAL und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
P(n, m) denotes the number of partitions of n with m parts, while Pm(n) denotes the number of partitions of n with parts at most m. It is a well-known result that the number of partitions of n ≥ 0 into m or fewer parts is equal to Pm(n). In the literature, there are some results for P(n, m) and Pm(n) for some values of m. In this work, we give more compact results for P(n, m) for the values of m ≤ 12. Furthermore, we obtain a method for determining P(n, m) when we know the expression for P(n, m − 1).
Zitieren
APA
SOYVURAL, Y., & EKİN, A. B. (2026). Some methods for finding the number of partitions of n with m−parts, P(n, m). Turkish Journal of Mathematics, 50(1), 23-39. https://doi.org/10.55730/1300-0098.3633
Vancouver
SOYVURAL Y, EKİN AB. Some methods for finding the number of partitions of n with m−parts, P(n, m). Turkish Journal of Mathematics. 2026;50(1):23-39. doi:10.55730/1300-0098.3633
BibTeX
@article{SOYVURAL2026,
author = {SOYVURAL, YUSUF and EKİN, ALİ BÜLENT},
title = {Some methods for finding the number of partitions of n with m−parts, P(n, m)},
journal = {Turkish Journal of Mathematics},
year = {2026},
volume = {50},
number = {1},
pages = {23--39},
doi = {10.55730/1300-0098.3633}
}
EUVIMED