About Van Der Waerden NumbersToday (2/2/2021) we have re-launched the project following acceptance for publication of a paper on our previous phase (see arxiv). Our research objectives in phase 2 are to focus on the two-color case, for which we have found several improvements in memory and compute efficiency. The last iteration of the project found 12 new bounds, and the current one should find about 5. Strange properties in our best primes have caused us to save the results for each prime (in short, the best primes p seem to be such that p-1 has few factors). You can monitor our development progress and view frequently asked questions here and post to the message boards or message me (id=1) with any problems. You can also check our latest bounds here and the last prime used here.
Van Der Waerden Numbers is a research project that uses Internet-connected computers to find better lower bounds for these numbers. The bold numbers in the table below are bounds improved or discovered by this project. You can participate by downloading and running a free program that runs on your computer when you're not using it. To participate, Download and run BOINC, and add Project 'vdwnumbers.org'. It only works with Windows and Linux computers. You can also Read our rules and policies. This is a project of Daniel Monroe.