All public logs

Combined display of all available logs of Polymath Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 13:27, 28 July 2009 WikiSysop talk contribs deleted page There is a deterministic algorithm to find primes if P=NP (content was: 'Consider the decision problem of determining whether there is a prime in the range <math>[m,n]</math>, where <math>m < n</math>. This problem is in NP, since...' (and the only contributor was 'WikiSysop'))