Timeline for Does anyone have ideas about how to simplify this combinatorial expression (mod 2)?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2022 at 22:43 | vote | accept | user473047 | ||
| Jan 20, 2022 at 17:22 | comment | added | Max Alekseyev | @user473047: I'm pretty sure this is covered in Concrete Mathematics, but can be also verified directly from the properties of $C(x)$ -- e.g., see mathoverflow.net/q/351445 One can also derive it from scratch using the generating function for binomial coefficients and Lagrange–Bürmann formula. | |
| Jan 20, 2022 at 16:45 | comment | added | user473047 | Thank you for your answer. I am having trouble understanding where the generating function $F_k(x)$ is coming from. Could you point me towards a reference or something with some more details about where that is coming from? I can see that this should be equivalent to the generating function for $\binom{(k+1)-r}{r}$, but still don't understand how to get to that answer. | |
| Jan 13, 2022 at 2:04 | history | edited | Max Alekseyev | CC BY-SA 4.0 |
added 23 characters in body; deleted 26 characters in body
|
| Jan 13, 2022 at 1:53 | history | answered | Max Alekseyev | CC BY-SA 4.0 |