rad(abc), where rad(n) is the product of the distinct prime factors of n. The ABC conjecture says that there are only finitely many a,b,c such that log(c)/log(rad(abc)) > h for any real h > 1. The ABC conjecture is currently one of the greatest open problems in mathematics. If it is proven to be true, a lot of other open problems can be answered directly from it."),
""
),
array(
tra("PrimeGrid"),
"http://www.primegrid.com/",
tra("Private"),
tra("Cryptography"),
tra("Primegrid is generating a public sequential prime number database, and is searching for large twin primes of the form k*2n+1 and k*2n-1"),
"primegrid_logo.png"
),
array(
tra("primaboinca"),
"http://www.primaboinca.com/",
tra("Hochschule RheinMain University of Applied Sciences"),
tra("Mathematics"),
tra("Search for counterexamples to two conjectures related to the identification of prime numbers"),
"logo_primaboinca.gif"
),
array(
tra("SZTAKI Desktop Grid"),
"http://szdg.lpds.sztaki.hu/szdg/",
tra("MTA-SZTAKI Laboratory of Parallel and Distributed Systems (Hungary)"),
tra("Mathematics"),
tra("Find all the generalized binary number systems (in which bases are matrices and digits are vectors) up to dimension 11."),
"szdg1_small.jpg"
),
// array(
// tra("Riesel Sieve"),
// "http://boinc.rieselsieve.com/",
// tra("Riesel Sieve community"),
// tra("Mathematics"),
// tra("Find prime numbers of the form k*2n-1"),
// ""
// ),
// array(
// tra("Rectilinear Crossing Number"),
// "http://dist.ist.tugraz.at/cape5/",
// tra("Graz University of Technology (Austria)"),
// tra("Mathematics"),
// tra("What is the least number of crossings a straight-edge drawing of the complete graph on top of a set of n points in the plane obtains? From very recent (not even published yet) mathematical considerations the rectilinear crossing numbers for n=19 and n=21 are also known. So the most tantalizing problem now is to determine the true value for n=18, which is the main focus of this project."),
// ""
// ),
array(
tra("Chess960@home"),
"http://www.chess960athome.org/alpha/",
tra("Chess-960.org"),
tra("Game-playing"),
tra("This project studies Chess 960, a variant of orthodox chess. In classical chess the starting position of the game never changes. In Chess 960, just before the start of every game, the initial configuration of the chess pieces is determined randomly."),
"chess960athome.jpg"
),
// array(
// tra("NQueens@home"),
// "http://nqueens.ing.udec.cl/",
// tra("Universidad de ConcepciĆ³n, Chile"),
// tra("Mathematics"),
// tra("The eight queens problem consists of trying to place eight queens on a chessboard so that no queen attacks any other queen. I has long been known that there are 92 solutions, of which 12 are distinct. NQueens@home studies the generalization to N queens on an NxN board, for N=19 and greater."),
// "NQueens-Logo1b.png"
// ),
array(
"sudoku@vtaiwan",
"http://sudoku.nctu.edu.tw/",
"National Chiao Tung University, Taiwan",
tra("Mathematics"),
"Sudoku@vtaiwan seeks to solve the minimum Sudoku problem, which is a well-known problem in mathematics and computer science.",
"sudoku.png"
),
),
);
$areas = array($biomed, $astro_phys_chem, $math, $earth, $mixed, $cogsci);
?>