Long pages

From Polymath1Wiki
Jump to: navigation, search

Showing below up to 20 results in range #21 to #40.

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)

  1. (hist) ‎Timeline ‎[38,539 bytes]
  2. (hist) ‎Finding narrow admissible tuples ‎[37,512 bytes]
  3. (hist) ‎Upper and lower bounds ‎[32,331 bytes]
  4. (hist) ‎Second lookup table C code ‎[31,841 bytes]
  5. (hist) ‎Coloring Hales-Jewett theorem ‎[31,673 bytes]
  6. (hist) ‎The polynomial Hirsch conjecture ‎[31,098 bytes]
  7. (hist) ‎Length 1120 sequences ‎[30,959 bytes]
  8. (hist) ‎Selberg sieve variational problem ‎[30,808 bytes]
  9. (hist) ‎Distribution of primes in smooth moduli ‎[29,739 bytes]
  10. (hist) ‎The Erdős discrepancy problem ‎[29,508 bytes]
  11. (hist) ‎Finding primes ‎[29,330 bytes]
  12. (hist) ‎4D Moser brute force search ‎[28,810 bytes]
  13. (hist) ‎Controlling H t-A-B/B 0 ‎[28,254 bytes]
  14. (hist) ‎Computer proof that completely multiplicative sequences have discrepancy greater than 2 ‎[27,097 bytes]
  15. (hist) ‎Human proof of the 3D Pareto-optimal Moser statistics ‎[26,910 bytes]
  16. (hist) ‎Fujimura's problem ‎[26,809 bytes]
  17. (hist) ‎Line-free sets correlate locally with complexity-1 sets ‎[24,792 bytes]
  18. (hist) ‎Coloring R 2 ‎[24,686 bytes]
  19. (hist) ‎Effective bounds on H t - second approach ‎[24,196 bytes]
  20. (hist) ‎Austin's proof II ‎[23,190 bytes]

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)