Short pages

Showing below up to 321 results in range #1 to #321.

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

1. (hist) ‎DJH(1,3) ‎[0 bytes]
2. (hist) ‎Benchmarks of small admissible tuples ‎[25 bytes]
3. (hist) ‎Biblio.tex ‎[44 bytes]
4. (hist) ‎Sequence of length 3250 ‎[79 bytes]
5. (hist) ‎Szemerédi's regularity lemma ‎[119 bytes]
6. (hist) ‎Outro.tex ‎[208 bytes]
7. (hist) ‎The complexity class DTIME ‎[436 bytes]
8. (hist) ‎Hindman's theorem ‎[454 bytes]
9. (hist) ‎Dhj.tex ‎[477 bytes]
10. (hist) ‎Smooth number ‎[498 bytes]
11. (hist) ‎Carlson-Simpson theorem ‎[561 bytes]
12. (hist) ‎Discretized Borel Determinacy and P=NP ‎[588 bytes]
13. (hist) ‎"New Proof" grant acknowledgments ‎[645 bytes]
14. (hist) ‎The HAP-subsequence structure of that sequence ‎[708 bytes]
15. (hist) ‎Cramer's conjecture ‎[724 bytes]
16. (hist) ‎T2(x) = -T3(x) ‎[735 bytes]
17. (hist) ‎Discrete logarithm ‎[745 bytes]
18. (hist) ‎Cramer's random model for the primes ‎[757 bytes]
19. (hist) ‎Convert raw input string into CSV table ‎[765 bytes]
20. (hist) ‎Side Proof 9 ‎[766 bytes]
21. (hist) ‎Density ‎[795 bytes]
22. (hist) ‎The complexity class BQP ‎[795 bytes]
23. (hist) ‎Immerman-Vardi theorem ‎[798 bytes]
24. (hist) ‎P=NP implies a deterministic algorithm to find primes ‎[819 bytes]
25. (hist) ‎Kruskal-Katona theorem ‎[840 bytes]
26. (hist) ‎Lemma 7 ‎[845 bytes]
27. (hist) ‎Corners ‎[863 bytes]
28. (hist) ‎Prove the result for shifted HAPs instead of HAPs ‎[879 bytes]
29. (hist) ‎Polymath4 grant acknowledgments ‎[915 bytes]
30. (hist) ‎Sequence of length 714 ‎[922 bytes]
31. (hist) ‎Szemerédi's theorem ‎[924 bytes]
32. (hist) ‎Roth's theorem ‎[973 bytes]
33. (hist) ‎Longest constrained sequences ‎[1,059 bytes]
34. (hist) ‎T32-invariant sequences ‎[1,070 bytes]
35. (hist) ‎Shifts and signs ‎[1,075 bytes]
36. (hist) ‎Generic prime ‎[1,087 bytes]
37. (hist) ‎TeX files for first paper ‎[1,099 bytes]
38. (hist) ‎Schinzel's hypothesis H ‎[1,130 bytes]
39. (hist) ‎Sylvester's sequence ‎[1,151 bytes]
40. (hist) ‎Verify the bounded discrepancy of sequence ‎[1,156 bytes]
41. (hist) ‎Abstract.tex ‎[1,239 bytes]
42. (hist) ‎Sequence of length 1091 ‎[1,267 bytes]
43. (hist) ‎Intransitive dice ‎[1,279 bytes]
44. (hist) ‎Polymath15 grant acknowledgments ‎[1,297 bytes]
45. (hist) ‎Carlson's theorem ‎[1,304 bytes]
46. (hist) ‎Verify the bounded discrepancy of an input sequence ‎[1,306 bytes]
47. (hist) ‎Graham-Rothschild theorem ‎[1,332 bytes]
48. (hist) ‎Corners theorem ‎[1,346 bytes]
49. (hist) ‎Folkman's theorem ‎[1,365 bytes]
50. (hist) ‎"Low Dimensions" grant acknowledgments ‎[1,390 bytes]
51. (hist) ‎Prime gaps ‎[1,392 bytes]
52. (hist) ‎T2(x) = T5(x) = -x ‎[1,445 bytes]
53. (hist) ‎Signed sums of prime reciprocals ‎[1,447 bytes]
54. (hist) ‎Finding primes with O(k) random bits ‎[1,454 bytes]
55. (hist) ‎Hardy-Littlewood prime tuples conjecture ‎[1,474 bytes]
56. (hist) ‎Kolmogorov complexity ‎[1,509 bytes]
57. (hist) ‎Character-like functions ‎[1,523 bytes]
58. (hist) ‎Friedlander-Iwaniec theorem ‎[1,583 bytes]
59. (hist) ‎Sequences given by modulated Sturmian functions ‎[1,612 bytes]
60. (hist) ‎Slice ‎[1,662 bytes]
61. (hist) ‎Side Proof 7 ‎[1,666 bytes]
62. (hist) ‎File output ‎[1,684 bytes]
63. (hist) ‎Factoring ‎[1,704 bytes]
64. (hist) ‎The prime factors of the places where the first two sequences of length 1124 differ ‎[1,706 bytes]
65. (hist) ‎Stirling's formula ‎[1,713 bytes]
66. (hist) ‎W-trick ‎[1,739 bytes]
67. (hist) ‎Combinatorial subspace ‎[1,771 bytes]
68. (hist) ‎Algorithm for finding multiplicative sequences with bounded discrepancy ‎[1,818 bytes]
69. (hist) ‎M=13 case of FUNC ‎[1,820 bytes]
70. (hist) ‎Thue-Morse-Hedlund Sequence ‎[1,831 bytes]
71. (hist) ‎Odlyzko's method ‎[1,846 bytes]
72. (hist) ‎Search for completely multiplicative sequences ‎[1,853 bytes]
73. (hist) ‎The complexity class NP ‎[1,899 bytes]
74. (hist) ‎First obtain multiplicative structure and then obtain a contradiction ‎[1,955 bytes]
75. (hist) ‎Linear norm grant acknowledgments ‎[1,979 bytes]
76. (hist) ‎Side Proof 8 ‎[2,051 bytes]
77. (hist) ‎Side Proof 5 ‎[2,054 bytes]
78. (hist) ‎M=13 Theorem ‎[2,086 bytes]
79. (hist) ‎Bounded Dirichlet inverse ‎[2,137 bytes]
80. (hist) ‎Fujimura.tex ‎[2,139 bytes]
81. (hist) ‎Szemerédi's combinatorial proof of Roth's theorem ‎[2,190 bytes]
82. (hist) ‎The complexity class BPP ‎[2,225 bytes]
83. (hist) ‎Representation of the diagonal ‎[2,265 bytes]
84. (hist) ‎Sequence of length 1112 ‎[2,289 bytes]
85. (hist) ‎6th roots of unity ‎[2,290 bytes]
86. (hist) ‎Dhj.bib ‎[2,328 bytes]
87. (hist) ‎An efficient algorithm exists if Cramer's conjecture holds ‎[2,335 bytes]
88. (hist) ‎Correlation with a 1-set implies correlation with a subspace ‎[2,357 bytes]
89. (hist) ‎Meissel-Lehmer method ‎[2,436 bytes]
90. (hist) ‎Genetic.tex ‎[2,499 bytes]
91. (hist) ‎Que porra n tem nada pra fazer network penetration test ‎[2,545 bytes]
92. (hist) ‎Side Proof 6 ‎[2,563 bytes]
93. (hist) ‎Higher-dimensional Fujimura ‎[2,574 bytes]
94. (hist) ‎Line ‎[2,675 bytes]
95. (hist) ‎T2(x) = -x ‎[2,710 bytes]
96. (hist) ‎Improving the bounds for Roth's theorem ‎[2,733 bytes]
97. (hist) ‎Function field version ‎[2,738 bytes]
98. (hist) ‎Horn clause formulation ‎[2,778 bytes]
99. (hist) ‎Different upper and lower bound ‎[2,833 bytes]
100. (hist) ‎Influence of variables ‎[2,855 bytes]
101. (hist) ‎DHJ(k) implies multidimensional DHJ(k) ‎[2,877 bytes]
102. (hist) ‎Logo ‎[2,935 bytes]
103. (hist) ‎The complexity class promise-BPP ‎[3,028 bytes]
104. (hist) ‎List of results implied by the Riemann Hypothesis ‎[3,032 bytes]
105. (hist) ‎Complexity of a set ‎[3,043 bytes]
106. (hist) ‎Definable Banach Spaces ‎[3,082 bytes]
107. (hist) ‎Lemma 7.6 ‎[3,144 bytes]
108. (hist) ‎The complexity class P ‎[3,159 bytes]
109. (hist) ‎DHJ(2.7) ‎[3,205 bytes]
110. (hist) ‎Szemerédi's original proof of Szemerédi's theorem ‎[3,375 bytes]
111. (hist) ‎Side Proof 1 ‎[3,474 bytes]
112. (hist) ‎Concentration of measure ‎[3,496 bytes]
113. (hist) ‎Proposals for finding long low-discrepancy sequences ‎[3,583 bytes]
114. (hist) ‎4th roots of unity ‎[3,655 bytes]
115. (hist) ‎Upper and lower discrepancy ‎[3,692 bytes]
116. (hist) ‎Length 1124 sequences ‎[3,729 bytes]
117. (hist) ‎Unsolved problems ‎[3,730 bytes]
118. (hist) ‎Quasirandomness ‎[3,823 bytes]
119. (hist) ‎Dhj.sty ‎[3,870 bytes]
120. (hist) ‎Short sequences statistics ‎[3,900 bytes]
121. (hist) ‎Bibliography ‎[3,958 bytes]
122. (hist) ‎Coloring.tex ‎[3,969 bytes]
123. (hist) ‎Classification of (6,12,18,4,0) sets ‎[3,974 bytes]
124. (hist) ‎Triangle removal lemma ‎[4,020 bytes]
125. (hist) ‎Polynomial strategy ‎[4,038 bytes]
126. (hist) ‎Abstract regularity lemma ‎[4,045 bytes]
127. (hist) ‎Matryoshka Sequences ‎[4,095 bytes]
128. (hist) ‎Generalize to a graph-theoretic formulation ‎[4,137 bytes]
129. (hist) ‎Basic facts about Bohr sets ‎[4,137 bytes]
130. (hist) ‎Original Elsevier statement ‎[4,139 bytes]
131. (hist) ‎A general result about density increments ‎[4,156 bytes]
132. (hist) ‎Outline of first paper ‎[4,289 bytes]
133. (hist) ‎Fourier reduction ‎[4,297 bytes]
134. (hist) ‎Bounding the derivative of H t ‎[4,473 bytes]
135. (hist) ‎Ergodic-inspired methods ‎[4,540 bytes]
136. (hist) ‎Wirsing translation ‎[4,551 bytes]
137. (hist) ‎Lookup table ‎[4,631 bytes]
138. (hist) ‎Kakeya problem ‎[4,701 bytes]
139. (hist) ‎Integer.tex ‎[4,708 bytes]
140. (hist) ‎Updating partial sums with Fenwick tree ‎[4,712 bytes]
141. (hist) ‎Pseudo-random generators (PRG) ‎[4,736 bytes]
142. (hist) ‎Riemann-Siegel formula ‎[4,765 bytes]
143. (hist) ‎Jun Fukuyama's P≠NP Paper ‎[4,808 bytes]
144. (hist) ‎Lindell's Critique ‎[4,820 bytes]
145. (hist) ‎Side Proof 2 ‎[4,853 bytes]
146. (hist) ‎Maximal discrepancy-2 sequence ‎[4,928 bytes]
147. (hist) ‎Lemma 7.5 ‎[4,941 bytes]
148. (hist) ‎Lemma 8 ‎[4,999 bytes]
149. (hist) ‎Bounded discrepancy multiplicative functions do not correlate with characters ‎[5,056 bytes]
150. (hist) ‎4D Moser sets with d at least 3 has at most 41 points ‎[5,067 bytes]
151. (hist) ‎DHJ(2.6) ‎[5,155 bytes]
152. (hist) ‎BK:Section 3 ‎[5,254 bytes]
153. (hist) ‎Multiplicative.c ‎[5,268 bytes]
154. (hist) ‎C code for Moser ‎[5,341 bytes]
155. (hist) ‎Polymath8 grant acknowledgments ‎[5,366 bytes]
156. (hist) ‎Boshernitzan’s problem ‎[5,421 bytes]
157. (hist) ‎Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity ‎[5,449 bytes]
158. (hist) ‎Obstructions to uniformity ‎[5,460 bytes]
159. (hist) ‎Genetic algorithm ‎[5,490 bytes]
160. (hist) ‎Drift ‎[5,553 bytes]
161. (hist) ‎Immerman's letter ‎[5,561 bytes]
162. (hist) ‎Stdout output ‎[5,585 bytes]
163. (hist) ‎Topological dynamics formulation ‎[5,599 bytes]
164. (hist) ‎A Hilbert space lemma ‎[5,659 bytes]
165. (hist) ‎Ergodic perspective ‎[5,712 bytes]
166. (hist) ‎Depth-first search for multiplicative sequences ‎[6,064 bytes]
167. (hist) ‎Overlapping Schwarz ‎[6,077 bytes]
168. (hist) ‎Outline of second paper ‎[6,145 bytes]
169. (hist) ‎Computing a HAP basis ‎[6,179 bytes]
170. (hist) ‎A-statistics code ‎[6,211 bytes]
171. (hist) ‎Equal-slices distribution for DHJ(k) ‎[6,254 bytes]
172. (hist) ‎Higherk.tex ‎[6,323 bytes]
173. (hist) ‎Partitioning.tex ‎[6,350 bytes]
174. (hist) ‎T m(x) = (+/-)T n(x) ‎[6,371 bytes]
175. (hist) ‎DHJ(1,3) ‎[6,550 bytes]
176. (hist) ‎Sperner's theorem ‎[6,572 bytes]
177. (hist) ‎Low discrepancy on PAPs ‎[6,721 bytes]
178. (hist) ‎Side Proof 10 ‎[6,724 bytes]
179. (hist) ‎Update ‎[6,949 bytes]
180. (hist) ‎Create tables in an HTML file from an input sequence ‎[7,018 bytes]
181. (hist) ‎Bounding the discrepancy in terms of the common difference ‎[7,053 bytes]
182. (hist) ‎Bounding the derivative of H t - third approach ‎[7,109 bytes]
183. (hist) ‎Iterated sumsets of log-primes ‎[7,118 bytes]
184. (hist) ‎Fourier-analytic proof of Sperner ‎[7,128 bytes]
185. (hist) ‎Estimate the number of discrepancy 2 sequences ‎[7,186 bytes]
186. (hist) ‎Polymath.tex ‎[7,407 bytes]
187. (hist) ‎Modification of the Ajtai-Szemerédi argument ‎[7,441 bytes]
188. (hist) ‎Dirichlet inverses ‎[7,446 bytes]
189. (hist) ‎Higher-dimensional DHJ numbers ‎[7,473 bytes]
190. (hist) ‎Roth's Theorem concerning discrepancy on Arithmetic Progression ‎[7,561 bytes]
191. (hist) ‎Oracle counterexample to finding pseudoprimes ‎[7,588 bytes]
192. (hist) ‎Insensitive.tex ‎[7,629 bytes]
193. (hist) ‎A general partitioning principle ‎[7,785 bytes]
194. (hist) ‎Frankl's union-closed conjecture ‎[7,809 bytes]
195. (hist) ‎4D Moser sets with d at least 2 have at most 42 points ‎[8,000 bytes]
196. (hist) ‎Furstenberg correspondence principle ‎[8,144 bytes]
197. (hist) ‎Lemma 1 ‎[8,167 bytes]
198. (hist) ‎Matlab script ‎[8,211 bytes]
199. (hist) ‎Correlation.tex ‎[8,324 bytes]
200. (hist) ‎Imo 2011 ‎[8,524 bytes]
201. (hist) ‎Side Proof 3 ‎[8,653 bytes]
202. (hist) ‎Sperner.tex ‎[8,669 bytes]
203. (hist) ‎Dhj-lown-lower.tex ‎[8,877 bytes]
204. (hist) ‎Other proposed projects ‎[8,921 bytes]
205. (hist) ‎Easy.tex ‎[9,055 bytes]
206. (hist) ‎Tidy problem page ‎[9,465 bytes]
207. (hist) ‎Pseudointegers ‎[9,794 bytes]
208. (hist) ‎IP-Szemerédi theorem ‎[9,930 bytes]
209. (hist) ‎Find a good configuration of HAPs ‎[9,967 bytes]
210. (hist) ‎Depth-first search ‎[10,102 bytes]
211. (hist) ‎3D Moser statistics ‎[10,105 bytes]
212. (hist) ‎Polymath1 ‎[10,169 bytes]
213. (hist) ‎Bertrand's postulate ‎[10,225 bytes]
214. (hist) ‎Optimal a-set pair code ‎[10,353 bytes]
215. (hist) ‎Line free sets correlate locally with dense sets of complexity k-2 ‎[10,416 bytes]
216. (hist) ‎Zero-free regions ‎[10,474 bytes]
217. (hist) ‎Linear norm ‎[10,503 bytes]
218. (hist) ‎The first 1124-sequence ‎[10,510 bytes]
219. (hist) ‎Find set configurations that imply FUNC ‎[10,532 bytes]
220. (hist) ‎Density increment method ‎[10,599 bytes]
221. (hist) ‎Word algebra ‎[10,657 bytes]
222. (hist) ‎Imo 2010 ‎[10,747 bytes]
223. (hist) ‎Imo 2012 ‎[10,759 bytes]
224. (hist) ‎Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎[10,949 bytes]
225. (hist) ‎Measures.tex ‎[10,956 bytes]
226. (hist) ‎Estimating a sum ‎[10,996 bytes]
227. (hist) ‎Limits with better properties ‎[11,080 bytes]
228. (hist) ‎Prime counting function ‎[11,233 bytes]
229. (hist) ‎Experimental results ‎[11,349 bytes]
230. (hist) ‎Side Proof 4 ‎[11,353 bytes]
231. (hist) ‎Finding optimal k0 values ‎[11,483 bytes]
232. (hist) ‎Excluding bichromatic vertices ‎[11,778 bytes]
233. (hist) ‎The Erdos-Rado sunflower lemma ‎[11,890 bytes]
234. (hist) ‎Refined greedy computation of multiplicative sequences ‎[11,987 bytes]
235. (hist) ‎Theproof.tex ‎[12,015 bytes]
236. (hist) ‎Dickson-Hardy-Littlewood theorems ‎[12,060 bytes]
237. (hist) ‎Thin triangles ‎[12,062 bytes]
238. (hist) ‎Bounding the derivative of H t - second approach ‎[12,149 bytes]
239. (hist) ‎Optimal a-set pairs ‎[12,214 bytes]
240. (hist) ‎4D Moser sets with d at least 4 have at most 40 points ‎[12,230 bytes]
241. (hist) ‎Notes on polytope decomposition ‎[12,285 bytes]
242. (hist) ‎Polylog parameterizability ‎[12,331 bytes]
243. (hist) ‎De Bruijn-Newman constant ‎[12,480 bytes]
244. (hist) ‎A second Fourier decomposition related to Sperner's theorem ‎[12,585 bytes]
245. (hist) ‎Equal-slices.tex ‎[12,728 bytes]
246. (hist) ‎Dynamics of zeros ‎[12,781 bytes]
247. (hist) ‎Main Page ‎[12,920 bytes]
248. (hist) ‎Maple calculations ‎[13,054 bytes]
249. (hist) ‎Ajtai-Szemerédi's proof of the corners theorem ‎[13,186 bytes]
250. (hist) ‎Intro.tex ‎[13,445 bytes]
251. (hist) ‎Furstenberg-Katznelson argument ‎[13,482 bytes]
252. (hist) ‎Online reactions to Deolalikar P vs NP paper ‎[14,017 bytes]
253. (hist) ‎Passing between measures ‎[14,076 bytes]
254. (hist) ‎Proof of DHJ(3) via density-increment ‎[14,554 bytes]
255. (hist) ‎Equal-slices measure ‎[14,762 bytes]
256. (hist) ‎DHJ(3) ‎[15,113 bytes]
257. (hist) ‎Multiplicative sequences ‎[15,250 bytes]
258. (hist) ‎Concepts.tex ‎[15,593 bytes]
259. (hist) ‎Random k-SAT ‎[15,895 bytes]
260. (hist) ‎A second outline of a density-increment argument ‎[16,130 bytes]
261. (hist) ‎Austin's proof ‎[16,491 bytes]
262. (hist) ‎Moser-lower.tex ‎[17,133 bytes]
263. (hist) ‎Introduction.tex ‎[18,075 bytes]
264. (hist) ‎Lattice approach ‎[18,569 bytes]
265. (hist) ‎Quantum Arrow's Theorem ‎[18,579 bytes]
266. (hist) ‎Outline.tex ‎[19,589 bytes]
267. (hist) ‎Rota's conjecture ‎[19,743 bytes]
268. (hist) ‎Asymptotics of H t ‎[19,908 bytes]
269. (hist) ‎Algebraic formulation of Hadwiger-Nelson problem ‎[19,919 bytes]
270. (hist) ‎An outline of a density-increment argument ‎[20,132 bytes]
271. (hist) ‎Discrepancy 3 multiplicative sequence of length 13186 ‎[20,326 bytes]
272. (hist) ‎Imo 2009 q6 ‎[20,704 bytes]
273. (hist) ‎Hyper-optimistic conjecture ‎[20,735 bytes]
274. (hist) ‎Effective bounds on H t ‎[20,850 bytes]
275. (hist) ‎Controlling A+B/B 0 ‎[21,641 bytes]
276. (hist) ‎Obtaining the correct bound in Roth's discrepancy theorem ‎[22,003 bytes]
277. (hist) ‎Human proof that completely multiplicative sequences have discrepancy greater than 2 ‎[22,123 bytes]
278. (hist) ‎Second attempt at computing H t(x) for negative t ‎[22,264 bytes]
279. (hist) ‎Dhj-lown.tex ‎[22,932 bytes]
280. (hist) ‎ABC conjecture ‎[22,952 bytes]
281. (hist) ‎Polymath15 test problem ‎[23,012 bytes]
282. (hist) ‎Austin's proof II ‎[23,190 bytes]
283. (hist) ‎Effective bounds on H t - second approach ‎[24,196 bytes]
284. (hist) ‎Coloring R 2 ‎[24,686 bytes]
285. (hist) ‎Line-free sets correlate locally with complexity-1 sets ‎[24,792 bytes]
286. (hist) ‎Fujimura's problem ‎[26,809 bytes]
287. (hist) ‎Human proof of the 3D Pareto-optimal Moser statistics ‎[26,910 bytes]
288. (hist) ‎Computer proof that completely multiplicative sequences have discrepancy greater than 2 ‎[27,097 bytes]
289. (hist) ‎Controlling H t-A-B/B 0 ‎[28,254 bytes]
290. (hist) ‎4D Moser brute force search ‎[28,810 bytes]
291. (hist) ‎Finding primes ‎[29,330 bytes]
292. (hist) ‎The Erdős discrepancy problem ‎[29,508 bytes]
293. (hist) ‎Distribution of primes in smooth moduli ‎[29,739 bytes]
294. (hist) ‎Selberg sieve variational problem ‎[30,808 bytes]
295. (hist) ‎Length 1120 sequences ‎[30,959 bytes]
296. (hist) ‎The polynomial Hirsch conjecture ‎[31,098 bytes]
297. (hist) ‎Coloring Hales-Jewett theorem ‎[31,673 bytes]
298. (hist) ‎Second lookup table C code ‎[31,841 bytes]
299. (hist) ‎Upper and lower bounds ‎[32,331 bytes]
300. (hist) ‎Finding narrow admissible tuples ‎[37,512 bytes]
301. (hist) ‎Timeline ‎[38,539 bytes]
302. (hist) ‎Stability of eigenfunctions ‎[38,845 bytes]
303. (hist) ‎Omega(N) ‎[41,117 bytes]
304. (hist) ‎Lookup table C code ‎[43,268 bytes]
305. (hist) ‎Bounded gaps between primes ‎[45,290 bytes]
306. (hist) ‎Journal publishing reform ‎[48,248 bytes]
307. (hist) ‎Scanning code ‎[49,664 bytes]
308. (hist) ‎Hadwiger-Nelson problem ‎[50,557 bytes]
309. (hist) ‎Deolalikar P vs NP paper ‎[50,894 bytes]
310. (hist) ‎The cost of knowledge ‎[50,983 bytes]
311. (hist) ‎Probabilistic formulation of Hadwiger-Nelson problem ‎[54,262 bytes]
312. (hist) ‎Vectors for the dual SDP ‎[55,205 bytes]
313. (hist) ‎Moser's cube problem ‎[56,872 bytes]
314. (hist) ‎The hot spots conjecture ‎[62,155 bytes]
315. (hist) ‎Moser.tex ‎[72,072 bytes]
316. (hist) ‎HAP tables for Sequence of length 470 ‎[79,605 bytes]
317. (hist) ‎Timeline of prime gap bounds ‎[83,733 bytes]
318. (hist) ‎Low discrepancy on primes and powers of 2 ‎[107,296 bytes]
319. (hist) ‎HAP table for Sequence of length 1112 ‎[188,747 bytes]
320. (hist) ‎Forced Drifts in Multiplicative Sequences ‎[224,134 bytes]
321. (hist) ‎Forced Drift of Six in Multiplicative Sequences ‎[964,670 bytes]

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