/prog/ Challenge #16324563001

Construct a flawed proof that P=NP that appears good enough to be published a respected journal and takes at least three months to be formally disproven.

Hard mode: Submit a correct proof that P=NP.

Deadline: 2014-12-31

Rewards:
1^st place: A copy of SICP, Satori Edition, signed by Hal Abelson himself.
2^nd place: A dunce hat and an uncomfortable stool to sit on in the corner.
3^rd place: A coupon for 25% off attendance to a Python convention.
Hard mode reward: All the bitcoins in the world.

N=1
done

you noob, if you have all bitcoins then they lose their value

>>2

P=0