From subhas@CS.WM.EDU Sun Mar 14 10:17:33 1993 To: adam@vlsi.cs.caltech.edu Subject: got by fingering kaul@cs.cornell.edu __________________________________________________________________________ ______________ ____ ____ ______________ | /\_____________\ /\___\ /\___\ /\_____________\ | /// ______ / /// \ /// //// ______ / | /// /___/// / _______ /// \ /// //// /___/// / | /// /____\/ / /\______\ /// /\ \ /// //// /____\/ / | /// __________/ _\/______/ /// / \ \/// //// __________/ | /// / /\______\ /// / \ \/ //// / | /// / \/______/ /// / \ //// / | \/___/ \/___/ \____/ \/___/ | | Due to popular demand, I present a short inductive proof... | Base Case: P = P (trivially true for K = 1) | Inductive Hypothesis: Let P = K P (for some K > 1) | To prove: P = (K + 1) P | = K P + P | (But P = K P from I.H. and P = P from Base Case, so K P + P = P + P) | = P + P | = 2 P | = P (From I.H., since K > 1, min value of K = 2) | Since P = K P and P = (K + 1) P, for some integer K, we conclude | by induction that ... | | P = N P QED. | | P.S.: Please mail Turing Award to above address. | | Disclaimer: This does not in any way express the views of the | Cornell University Computer Science Department or | Juris Hartmanis. | __________________________________________________________________________|