Yahoo Answers is shutting down on May 4th, 2021 (Eastern Time) and beginning April 20th, 2021 (Eastern Time) the Yahoo Answers website will be in read-only mode. There will be no changes to other Yahoo properties or services, or your Yahoo account. You can find more information about the Yahoo Answers shutdown and how to download your data on this help page.

can someone help with this math problem, please?!?

Let Fp = Z/pZ be the field of p elements, where p is an odd prime. Label the

elements of Fp as 0,1,2, . . . , p−1 modulo p. Prove Wilson’s Theorem:

(p−1)! ≡ −1 (mod p)

as follows: observe that, by Fermat’s Theorem, the polynomial

f(x) = x^(p−1)− 1

in Fp[x] has 1,2, . . . , p − 1 as roots. Apply the Root Theorem to get a complete

factorization of

x^(p−1)−1 into linear factors, and then compare the constant term of

the product of the factors with the constant term of f(x).

1 Answer

Relevance
  • Ben
    Lv 7
    9 years ago
    Favorite Answer

    start with

    f(x) = x^(p-1) - 1

    By the root theorem, we have

    f(x) = (x - 1)(x - 2)(x - 3)...(x - (p-1))

    the constant of the above is -1.

    the constant term of the bottom is

    (-1)*(-2)*...*(-(p-1)) =

    (-1)^(p-1) * (p - 1)! = ...since p is an odd prime...

    (p - 1)!

    Since the constant terms are equal, Wilson's theorem holds.

Still have questions? Get your answers by asking now.