Mircea MERCA

102104

New recurrences for Euler's partition function

In this paper, the author invokes some consequences of the bisectional pentagonal number theorem to derive two linear recurrence relations for Euler's partition function $p(n)$. As a corollary of these results, we obtain an efficient method to compute the parity of Euler's partition function $p(n)$ that requires only the parity of $p(k)$ with $k \leq n/4$.

Keywords:

Partition function, pentagonal number theorem recurrence relation,

Turkish Journal of Mathematics-Cover

ISSN: 1300-0098
Yayın Aralığı: 6
Yayıncı: TÜBİTAK

Arşiv

Sayıdaki Diğer Makaleler

Mümün CAN, Muhammet Cihat DAĞLI

Seyfollah MOSAZADEH

Asuman Güven AKSOY, Monairah AL-ANSARI, Caleb CASE, Qidi PENG

Mohammad Reza DARAFSHEH, Maysam YAGHOOBIAN

Cyclic codes over $\mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4}$

Mehmet ÖZEN, Nazmiye Tuğba ÖZZAİM, Nuh AYDIN

Niovi KEHAYOPULU

Raul DURAN DIAZ, Luis HERNANDEZ ENCINAS, Agustin MARTİN MUNOZ, Jaime MUNOZ MASQUE, Seok-Zun SONG

Depth and Stanley depth of the path ideal associated to an nn-cyclic graph

Jing LENG, Zheng-Pan WANG, Hou Yi YU