Long pages

From Polymath Wiki
Jump to navigationJump to search

Showing below up to 50 results in range #251 to #300.

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

  1. (hist) ‎Search for completely multiplicative sequences ‎[1,853 bytes]
  2. (hist) ‎Odlyzko's method ‎[1,846 bytes]
  3. (hist) ‎Thue-Morse-Hedlund Sequence ‎[1,831 bytes]
  4. (hist) ‎M=13 case of FUNC ‎[1,820 bytes]
  5. (hist) ‎Algorithm for finding multiplicative sequences with bounded discrepancy ‎[1,818 bytes]
  6. (hist) ‎Combinatorial subspace ‎[1,771 bytes]
  7. (hist) ‎W-trick ‎[1,739 bytes]
  8. (hist) ‎Stirling's formula ‎[1,713 bytes]
  9. (hist) ‎The prime factors of the places where the first two sequences of length 1124 differ ‎[1,706 bytes]
  10. (hist) ‎Factoring ‎[1,704 bytes]
  11. (hist) ‎File output ‎[1,684 bytes]
  12. (hist) ‎Side Proof 7 ‎[1,666 bytes]
  13. (hist) ‎Slice ‎[1,662 bytes]
  14. (hist) ‎Sequences given by modulated Sturmian functions ‎[1,612 bytes]
  15. (hist) ‎Friedlander-Iwaniec theorem ‎[1,583 bytes]
  16. (hist) ‎Character-like functions ‎[1,523 bytes]
  17. (hist) ‎Kolmogorov complexity ‎[1,509 bytes]
  18. (hist) ‎Hardy-Littlewood prime tuples conjecture ‎[1,474 bytes]
  19. (hist) ‎Finding primes with O(k) random bits ‎[1,454 bytes]
  20. (hist) ‎Signed sums of prime reciprocals ‎[1,447 bytes]
  21. (hist) ‎T2(x) = T5(x) = -x ‎[1,445 bytes]
  22. (hist) ‎Prime gaps ‎[1,392 bytes]
  23. (hist) ‎"Low Dimensions" grant acknowledgments ‎[1,390 bytes]
  24. (hist) ‎Folkman's theorem ‎[1,365 bytes]
  25. (hist) ‎Corners theorem ‎[1,346 bytes]
  26. (hist) ‎Graham-Rothschild theorem ‎[1,332 bytes]
  27. (hist) ‎Verify the bounded discrepancy of an input sequence ‎[1,306 bytes]
  28. (hist) ‎Carlson's theorem ‎[1,304 bytes]
  29. (hist) ‎Polymath15 grant acknowledgments ‎[1,297 bytes]
  30. (hist) ‎Intransitive dice ‎[1,279 bytes]
  31. (hist) ‎Sequence of length 1091 ‎[1,267 bytes]
  32. (hist) ‎Abstract.tex ‎[1,239 bytes]
  33. (hist) ‎Verify the bounded discrepancy of sequence ‎[1,156 bytes]
  34. (hist) ‎Sylvester's sequence ‎[1,151 bytes]
  35. (hist) ‎Schinzel's hypothesis H ‎[1,130 bytes]
  36. (hist) ‎TeX files for first paper ‎[1,099 bytes]
  37. (hist) ‎Generic prime ‎[1,087 bytes]
  38. (hist) ‎Shifts and signs ‎[1,075 bytes]
  39. (hist) ‎T32-invariant sequences ‎[1,070 bytes]
  40. (hist) ‎Longest constrained sequences ‎[1,059 bytes]
  41. (hist) ‎Roth's theorem ‎[973 bytes]
  42. (hist) ‎Szemerédi's theorem ‎[924 bytes]
  43. (hist) ‎Sequence of length 714 ‎[922 bytes]
  44. (hist) ‎Polymath4 grant acknowledgments ‎[915 bytes]
  45. (hist) ‎Prove the result for shifted HAPs instead of HAPs ‎[879 bytes]
  46. (hist) ‎Corners ‎[863 bytes]
  47. (hist) ‎Lemma 7 ‎[845 bytes]
  48. (hist) ‎Kruskal-Katona theorem ‎[840 bytes]
  49. (hist) ‎P=NP implies a deterministic algorithm to find primes ‎[819 bytes]
  50. (hist) ‎Immerman-Vardi theorem ‎[798 bytes]

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

Retrieved from "https://michaelnielsen.org/polymath/index.php?title=Special:LongPages"