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 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
How to calculate the coefficient of $$$\prod\limits_{i=0}^{p-1}(x+i) \bmod p$$$ ($$$p$$$ is a prime)? Thank you for reply.
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.