ECM is a program for Elliptic Curve Factorization which is used by a couple of projects to find factors for different kind of numbers. Supported ecm projects:
Aliquot Sequences
Oddperfect
ElevenSmooth
XYYXF
NearRepdigit
RepUnit
Mersenne-Primzahlen + 2
CullenWoodall
UpfortheCount
Siever
This subproject produces Sieve Files for the CRUS-project. We are sieving for Riesel/Sierpinski to b conjectures where b<1030. (Form: k*b^n-/+1). Sieve files are needed to start testing for primes.
M Queens
The M queens puzzle is the problem of placing M chess queens on an M x M chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. It starts with M = 24
Euler Euler (6,2,5) computes minimal equal sums of power 6. The project is dedicated to all those who are fascinated by powers and integers.
Harmonious Trees Graham and Sloane proposed in 1980 a conjecture stating that every tree has a harmonious labelling, a graph labelling closely related to additive base. We do a computational approach to this conjecture by checking trees with limited size.
Odd Weird Search This project is a number-theoretic project which searches for odd weird numbers. In fact, no odd weird number is known. Previous effort searches up to 1017. The project continues this effort of searching for odd weird numbers up to 1021.
Muon Muon simulates and designs parts of a particle accelerator. You are simulating the part of the process where the proton beam hits the target rod and causes pions to be emitted, which decay into muons.
evolution@home evolution@home represents the first and so far only distributed computing project addressing evolutionary research. It simulates different types of populations and focuses on the analysis of human mitochondrial DNA.
Nontrivial Collatz Cycles Nontrivial Collatz Cycle wants to prove that there are no Collatz Cycles with length < 17*10^9 other than 1 - 4 - 2. Therefore it searches for Path Records with start numbers up tp 10^21.
Perfect Cuboids Aims to find Perfect Cuboid or prove that if it exists, his space diagonal must be greater than 2^63. During the moving up we also will find almost perfect cuboids: Edge and Face cuboids (completely) and some kinds of cuboids in complex numbers (Perfect Complex, Imaginary and Twilight).
