# Long pages

From Polymath1Wiki

Showing below up to **50** results in range #**1** to #**50**.

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

- (hist) Forced Drift of Six in Multiplicative Sequences [964,670 bytes]
- (hist) Forced Drifts in Multiplicative Sequences [224,134 bytes]
- (hist) HAP table for Sequence of length 1112 [188,747 bytes]
- (hist) Low discrepancy on primes and powers of 2 [107,296 bytes]
- (hist) Timeline of prime gap bounds [83,733 bytes]
- (hist) HAP tables for Sequence of length 470 [79,605 bytes]
- (hist) Moser.tex [72,072 bytes]
- (hist) The hot spots conjecture [62,155 bytes]
- (hist) Moser's cube problem [56,872 bytes]
- (hist) Vectors for the dual SDP [55,205 bytes]
- (hist) Probabilistic formulation of Hadwiger-Nelson problem [54,126 bytes]
- (hist) The cost of knowledge [50,983 bytes]
- (hist) Deolalikar P vs NP paper [50,894 bytes]
- (hist) Scanning code [49,664 bytes]
- (hist) Journal publishing reform [48,248 bytes]
- (hist) Hadwiger-Nelson problem [45,923 bytes]
- (hist) Bounded gaps between primes [45,176 bytes]
- (hist) Lookup table C code [43,268 bytes]
- (hist) Omega(N) [41,117 bytes]
- (hist) Stability of eigenfunctions [38,845 bytes]
- (hist) Timeline [38,539 bytes]
- (hist) Finding narrow admissible tuples [37,512 bytes]
- (hist) Upper and lower bounds [32,331 bytes]
- (hist) Second lookup table C code [31,841 bytes]
- (hist) Coloring Hales-Jewett theorem [31,673 bytes]
- (hist) The polynomial Hirsch conjecture [31,098 bytes]
- (hist) Length 1120 sequences [30,959 bytes]
- (hist) Selberg sieve variational problem [30,808 bytes]
- (hist) Distribution of primes in smooth moduli [29,739 bytes]
- (hist) The Erdős discrepancy problem [29,508 bytes]
- (hist) Finding primes [29,330 bytes]
- (hist) 4D Moser brute force search [28,810 bytes]
- (hist) Controlling H t-A-B/B 0 [28,254 bytes]
- (hist) Computer proof that completely multiplicative sequences have discrepancy greater than 2 [27,097 bytes]
- (hist) Human proof of the 3D Pareto-optimal Moser statistics [26,910 bytes]
- (hist) Fujimura's problem [26,809 bytes]
- (hist) Line-free sets correlate locally with complexity-1 sets [24,792 bytes]
- (hist) Coloring R 2 [24,686 bytes]
- (hist) Effective bounds on H t - second approach [24,196 bytes]
- (hist) Austin's proof II [23,190 bytes]
- (hist) Polymath15 test problem [23,012 bytes]
- (hist) ABC conjecture [22,952 bytes]
- (hist) Dhj-lown.tex [22,932 bytes]
- (hist) Second attempt at computing H t(x) for negative t [22,264 bytes]
- (hist) Human proof that completely multiplicative sequences have discrepancy greater than 2 [22,123 bytes]
- (hist) Obtaining the correct bound in Roth's discrepancy theorem [22,003 bytes]
- (hist) Controlling A+B/B 0 [21,641 bytes]
- (hist) Effective bounds on H t [20,850 bytes]
- (hist) Hyper-optimistic conjecture [20,735 bytes]
- (hist) Imo 2009 q6 [20,704 bytes]