P=np

[jstep]

My calc teacher told us in order to pass for the second sememster we must successfully solve this problem. However since It has never been solved I don't know where to start.




















Jk, Its pretty interesting stuff though
http://www.claymath.org/millennium/P_vs_NP/Official_Problem_Description.pdf

 

[Qwert]

The answer is 17 LOL

I give up after the problem passes 2 pages...

 

[RJ]

All I can say is... good luck, mate. :lol:

 

[Complete Hostings]

Yeah have fun doing that i got a head ache reading that page you added

 

[Sabre]

Hmmm... i think ill let you do it somehow

 

[{insert name here}]

WOW, why did I read that entire thing

I found it amusing, but I now understand that P does not equal NP, under this basis,
P/(NP)2 -NP*P/NP-(p)2/P+NP(3) = :p <--- :notme:

Just playin, have fun with it! :blink:

 

[armstrong]

The answer is 17 LOL

I give up after the problem passes 2 pages...

You gave up after 2 pages? I had to reread the first sentence three times before deciding that manually going through the 1,219,778 domains currently on hold would probably be more productive. :tri:

 

[LeeRyder]

sorry guys.. but this one is easy (your teachers wrong btw). this was answered many years ago:

.618
aka, the divine Principle (OR the Golden Rule).

 

[{insert name here}]

sorry guys.. but this one is easy (your teachers wrong btw). this was answered many years ago:

.618
aka, the divine Principle (OR the Golden Rule).

Uhh right, the anwser isnt a # its either True or False

:tri:

 

[Qwert]

You gave up after 2 pages? I had to reread the first sentence three times before deciding that manually going through the 1,219,778 domains currently on hold would probably be more productive. :tri:

LOL, I just read it and decided, **** this... I didn't solve anything.

 

[jstep]

anyone else watch the show numbers?

 

[flexiwebhost.com]

have you got a link to the english version please

I'm glad I work for a living instead of all that education stuff again lol

 

[jstep]

i wish ;0

 

[ExpertDomino]

Here's Your Answer:

http://kryten.mm.rpi.edu/scb.pnp.solved14.pdf

The Modalized Proof

1 ∃M∀n(M solves STPn in polynomial time) → P=NP definition of NP-completeness
2
p∃A∀n (A solves B(STP)n in polynomial time ∧N(A)) derivable, e.g., by induction and existential
introduction from soapfilm process, i.e., As
3
p∃A∀n (A solves B(STP)n in polynomial time ∧N(A)) →

p∃Mp∀n(Mp solves B(STP)n in polynomial time) digital physics; see below
4
p∃Mp∀n(Mp solves B(STP)n in polynomial time →
∃M∀n(M solves STPn in polynomial time)) unassailable; see justification 3rd ¶
5 P=NP 1–4 (full FOL derivation trivial)

 

[jstep]

Key word, Modelized proof

Model

THis problem is not solvable, there are mor epossible answers than there are electrons in the universe