Amicable Numbers is an independent research project that uses Internet-connected computers to find new amicable pairs. You can contribute to our research by running a free program on your computer. Current goal of the project is to find all amicable pairs with smallest member < 264. All new findings are published regularly on the Amicable pairs list page. Amicable Numbers
BOINC-project ODLK1 continues to solve the problem of BOINC-project ODLK. The project generates a database of canonical forms (CF) of diagonal Latin squares (DLS) of order 10 having orthogonal diagonal Latin squares (ODLS).
Moo! Wrapper brings together BOINC volunteer computing network resources and the Distributed.net projects. It allows a BOINC Client to participate in the RC5-72 challenge. If you want to learn more about Distributed.net Project and Client, please visit their website. Especially, detailed information about the RC5-72 challenge is available. Note that we have intentionally left Distributed.net OGR-project out of scope since you can already join that project at Yoyo@Home. Moo! Wrapper
NumberFields@home is a research project that uses Internet-connected computers to do research in number theory. You can participate by downloading and running a free program on your computer. NumberFields@home searches for fields with special properties. The primary application of this research is in the realm of algebraic number theory. Number theorists can mine the data for interesting patterns to help them formulate conjectures about number fields. Ultimately, this research will lead to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. A more detailed description of the project can be found here. NumberFields@home is based at the school of mathematics at Arizona State University. The final results of this project will be complete tables of number fields. The results are given in table form or as a searchable database. NumberFields@Home
In the project, a database of canonical forms (CR) of diagonal Latin squares (DLK) of the 10th order having orthogonal diagonal Latin squares (ODLC) is compiled. The necessary definitions for the topic can be found here: https://en.wikipedia.org/wiki/Latin_square https://en.wikipedia.org/wiki/Latin Square The first three orthogonal pairs of DLK were found in 1992, they were published in the article "Completion of the Spectrum of Orthogonal Diagonal Latin Squares" (JW Brown et al.). In 2012-2016 years. There was a scientific BOINC project SAT @ home, in which new orthogonal pairs of the 10th order DLK were searched. https://en.wikipedia.org/wiki/SAT@home http://sat.isa.ru/pdsat/ In this project were found 77 unique orthogonal pairs of DLK, which gave 154 unique KF ODLK. You can see the solutions found in the SAT @ home project here: http://sat.isa.ru/pdsat/solutions.php The database produced in the submitted project includes solutions found in the SAT @ home project
PrimeGrid's primary goal is to bring the excitement of prime finding to the "everyday" computer user. By simply downloading and installing BOINC and attaching to the PrimeGrid project, participants can choose from a variety of prime forms to search. With a little patience, you may find a large or even record breaking prime and enter into Chris Caldwell's The Largest Known Primes Database as a Titan! PrimeGrid's secondary goal is to provide relevant educational materials about primes. Additionally, we wish to contribute to the field of mathematics. Lastly, primes play a central role in the cryptographic systems which are used for computer security. Through the study of prime numbers it can be shown how much processing is required to crack an encryption code and thus to determine whether current security schemes are sufficiently secure. PrimeGrid
SRBase is a mathematical research project that uses Internet-connected computers trying to solve Sierpinski / Riesel Bases up to 1030. You can participate by downloading and running a free program on your computer. The project is in collaboration with the Mersenne CRUS project. The server is running on a private computer in a VM. SRBase
WEP-M+2 (wanless2) is a research project that uses Internet-connected computers to do research in number theory. You can participate by downloading and running a free program on your computer. WEP-M+2 is based at London, UK, and is currently investigating factorization of Mersenneplustwo numbers. WEP-M+2