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 ⩽ n/4

PDF

___

[1] Andrews GE. The Theory of Partitions. New York, NY, USA: Addison-Wesley Publishing, 1976.
[2] Andrews GE, Eriksson K. Integer Partitions. Cambridge, UK: Cambridge University Press, 2004.
[3] Ballantine C, Merca M. Parity of sums of partition numbers and squares in arithmetic progressions. Ramanujan J (in press).
[4] Merca M. The bisectional pentagonal number theorem. J Number Theory 2015; 157: 223-232.
[5] Merca M. Fast computation of the partition function. J Number Theory 2016; 164: 405-416.
[6] Watson GN. Two tables of partitions. P Lond Math Soc 1937; 42: 550-556.

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

Arşiv