Prime counting function: Revision history

31 August 2009

• curprev 12:5812:58, 31 August 2009‎ WikiSysop talk contribs‎ 11,233 bytes +273‎ Minor smoothing of the first section
• curprev 10:0010:00, 31 August 2009‎ HAHelfgott talk contribs‎ 10,960 bytes +17‎ →‎Breaking the square root barrier
• curprev 10:0010:00, 31 August 2009‎ HAHelfgott talk contribs‎ 10,943 bytes +2‎ →‎Breaking the square root barrier
• curprev 09:5909:59, 31 August 2009‎ HAHelfgott talk contribs‎ 10,941 bytes +35‎ No edit summary

30 August 2009

• curprev 13:3013:30, 30 August 2009‎ Teorth talk contribs‎ 10,906 bytes +5,330‎ →‎Computing the parity of \pi(x)

19 August 2009

• curprev 07:4607:46, 19 August 2009‎ Teorth talk contribs‎ 5,576 bytes +2,520‎ No edit summary

12 August 2009

• curprev 09:4809:48, 12 August 2009‎ Teorth talk contribs‎ 3,056 bytes +3,056‎ New page: One way to find primes is to find a polynomial time algorithm to compute <math>\pi(x)</math>, the number of primes less than x, to reasonable accuracy (e.g. if we can do...