Timeline for Generating function for numbers divisible by some primes
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 2, 2016 at 7:12 | answer | added | Fedor Petrov | timeline score: 2 | |
| Jun 2, 2016 at 7:00 | comment | added | Danny Nguyen | Yes. This is true. The polynomial $P$ must contain many monomials however. | |
| Jun 2, 2016 at 6:56 | comment | added | Qiaochu Yuan | $A_k$ is a finite union of arithmetic progressions with common difference $p_1 \dots p_k$, so the generating function has the form $\frac{P(x)}{1 - x^{p_1 \dots p_k}}$ for some polynomial $P(x)$. The computation of $P(x)$ is exactly the computation of the first $p_1 \dots p_k$ terms of the sequence. I don't know if that's the sort of answer you're looking for. | |
| Jun 2, 2016 at 6:50 | history | asked | Danny Nguyen | CC BY-SA 3.0 |