Let Q(N ) denote the number of partitions of N into distinct parts. If |(k) := (3k 2 +k)Γ2, then it is well known that In this short note we start with Tunnell's work on the ``congruent number problem'' and show that Q(N ) often satisfies ``weighted'' recurrence type relations. For every N there is
Divisibility and Distribution of Partitions into Distinct Parts
β Scribed by Jeremy Lovejoy
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 116 KB
- Volume
- 158
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
β¦ Synopsis
We study the generating function for Q(n), the number of partitions of a natural number n into distinct parts. Using the arithmetic properties of Fourier coefficients of integer weight modular forms, we prove several theorems on the divisibility and distribution of Q(n) modulo primes p 5.
π SIMILAR VOLUMES
Let Q(n) denote the number of partitions of an integer n into distinct parts. For positive integers j, the first author and B. Gordon proved that Q(n) is a multiple of 2 j for every non-negative integer n outside a set with density zero. Here we show that if i 0 (mod 2 j ), then In particular, Q(n)