P Versus NP Resolutions Abounding?

Subject:	P Versus NP Resolutions Abounding?
Date:	Wed, 9 Dec 2009 07:22:03 -0800 (PST)

== Musatov's lemma ==

Musatov's lemma is named after the one-to-one function:

Let a = 1
Let b = 2
Let e = 5
Let j = 10
Let s = 19
Let u = 21

Then:

j * a/b = e
e * s = 95
u * 95 = 1,995
s/abej * 1,995 = 361

One of Ramanujan's approximations of was (9^2 + (19^2/22))^1/4. 361 is
a prime square (19^2).

== Polynomial Time Algorithm ==

// --- src/htmlparse.c.bak 2007-09-16 00:20:18.000000000 +0900
// +++ src/htmlparse.c 2007-09-16 00:20:24.000000000 +0900
// @@ -853,8 +853,7 @@
//
// #ifndef NDEBUG
// int nMax = zText ? strlen(zText) : 0;
// - int *pnMax = zText ? &nMax : 0;
// -#define nMaxMayVary (zText ? *pnMax : \
// +#define nMaxMayVary (zText ? nMax : \
// (Tcl_GetStringFromObj(pTree->pDocument, &nMax) \
// ? nMax : 0))
// #endif