happy birthday! though i'm surprised that you are measuring the age of rankk in years... 250 challenges would certainly be a more conceptual jubilee ;)
andersonw: how do you prove that P = 0 or N = 1 holds? all i can do is the following:
P = PP (the composition of two polynomials is a polynomial) yields P = 0 or P = 1;
NN = 1 (not not = yes) yields N = 1 or N = -1.
now i've got problems with the (P, N) = (1, -1) case... it would contradict P = NP.
ah, got it. the case is impossible, since (P, N) = (1, -1) states that "1 is a Polynomial, but -1 is Not", what is obviously wrong... polynomials are closed under additive inversion.
nice proof!
~skr
Last edited on 2008-10-11 03:31:03 by Pha. skraeling
would you prefer the pain and suffering we had?
would you prefer to be in peril, even dead?
would you prefer to live the life we've learned to dread?
would you prefer to live a mortal life instead?...
Posted by 
on 2008-10-09 20:18:59 
on 2008-10-10 01:22:08 
on 2008-10-10 19:56:12