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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 159 |
5 | nor | 155 |
6 | maroonrk | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Название |
---|
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.