Long pages

From Polymath1Wiki
Jump to: navigation, search

Showing below up to 20 results in range #31 to #50.

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

  1. (hist) ‎Finding primes ‎[29,330 bytes]
  2. (hist) ‎4D Moser brute force search ‎[28,810 bytes]
  3. (hist) ‎Controlling H t-A-B/B 0 ‎[28,254 bytes]
  4. (hist) ‎Computer proof that completely multiplicative sequences have discrepancy greater than 2 ‎[27,097 bytes]
  5. (hist) ‎Human proof of the 3D Pareto-optimal Moser statistics ‎[26,910 bytes]
  6. (hist) ‎Fujimura's problem ‎[26,809 bytes]
  7. (hist) ‎Line-free sets correlate locally with complexity-1 sets ‎[24,792 bytes]
  8. (hist) ‎Coloring R 2 ‎[24,686 bytes]
  9. (hist) ‎Effective bounds on H t - second approach ‎[24,196 bytes]
  10. (hist) ‎Austin's proof II ‎[23,190 bytes]
  11. (hist) ‎Polymath15 test problem ‎[23,012 bytes]
  12. (hist) ‎ABC conjecture ‎[22,952 bytes]
  13. (hist) ‎Dhj-lown.tex ‎[22,932 bytes]
  14. (hist) ‎Second attempt at computing H t(x) for negative t ‎[22,264 bytes]
  15. (hist) ‎Human proof that completely multiplicative sequences have discrepancy greater than 2 ‎[22,123 bytes]
  16. (hist) ‎Obtaining the correct bound in Roth's discrepancy theorem ‎[22,003 bytes]
  17. (hist) ‎Controlling A+B/B 0 ‎[21,641 bytes]
  18. (hist) ‎Effective bounds on H t ‎[20,850 bytes]
  19. (hist) ‎Hyper-optimistic conjecture ‎[20,735 bytes]
  20. (hist) ‎Imo 2009 q6 ‎[20,704 bytes]

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