How to calculate the coefficient of $$$\prod\limits_{i=0}^{p-1}(x+i) \bmod p$$$ ($$$p$$$ is a prime)? Thank you for reply.
How to calculate the coefficient of $$$\prod\limits_{i=0}^{p-1}(x+i) \bmod p$$$ ($$$p$$$ is a prime)? Thank you for reply.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
| Name |
|---|



It is also the first kind of Stirling number.
which coefficient r u interested in?
In fact the answer is very beautiful, but sadly no one mentioned it.. It equals to $$$x^p-x$$$. I don't know why, can anyone explain it?
From Fermat's theory we know that $$$x^p \equiv x\pmod p$$$ holds for every integer. So when modulo $$$p$$$, $$$F(x)=x^p-x$$$ must be a multiple of $$$x,x+1,…,x+(p-1)$$$ at the same time. Pay attention to the fact that $$$F$$$ is of degree $$$p$$$, and the given equation is proved.
Now, I'm not a math genius or anything.
However, I do know that when multiplying a list of X consecutive numbers, the result is always divisible by X. Therefore, the answer to your question is 0, because the result is always divisible by P, even if P is a prime.
I want to calculate the coefficient for every $$$x^i$$$, and the answer is $$$x^p-x$$$, that there is only two nonempty positions.