The P=NP problem solved!
in [Math]
|
Prev: Thinking About Kinematics Lowers the Sum of Systolic + Pulse Rate
Next: Telescopic-Eclipse Technique Chapt10, Fiberglass Experiment #103; ATOM TOTALITY
From: Ostap Bender on 22 May 2010 01:03 I have a very elegant proof that P = NP if and only if N = 1 or P = 0, but the margins of the Usenet are too narrow for me to write down this proof. Email me for details.
From: Etienne Rousee on 22 May 2010 05:25 Le 22/05/2010 07:03, Ostap Bender a �crit : > I have a very elegant proof that P = NP if and only if N = 1 or P = 0, > but the margins of the Usenet are too narrow for me to write down this > proof. Email me for details. There are others solutions in Z/nZ if n is not a prime number. For example N = 4 and P = 2 in Z/6Z -- Etienne
From: Ostap Bender on 22 May 2010 19:09
On May 22, 2:25 am, Etienne Rousee <etie...(a)rousee.org> wrote: > Le 22/05/2010 07:03, Ostap Bender a écrit : > > > I have a very elegant proof that P = NP if and only if N = 1 or P = 0, > > but the margins of the Usenet are too narrow for me to write down this > > proof. Email me for details. > > There are others solutions in Z/nZ if n is not a prime number. > For example N = 4 and P = 2 in Z/6Z Well, I was restricting myself to fields, but with hard work, humankind may some day be able to generalize my brilliant results to other, less divisive rings. |