Revision as of 04:07, 30 October 2008 by Has (Talk)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
  • I am kinda lost in this chapter. Could someone enlighten me on this question? I missed one of the lecture.

-Wooi-Chen Ng

I can prove part a if p is prime, but I'm not sure how to prove that p is prime. Any ideas?


Not too sure if this is right: Please, correct me if I am wrong.

Let X = x^(p^(n-1)) and Let Y = y^(p^(n-1))

From part a & induction:

(X+Y)^p = X^p + Y^p = x^p^n + y^p^n

and

(X+Y)^p = (x^(p^(n-1))+y^(p^(n-1)))^p = (x+y)^p^n = x^p^n + y^p^n.


The part C. P should be a prime number. (x+y)^4 = x^4 + 4x^3y + 6x^2y^2 + 4xy^3 + y^4 so, it could be any number that is not prime. -Soo

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood