Volunteer Computing

How do you solve a problem like Sierpinski?

Author: Iain Bethune
Posted: 7 Nov 2016 | 15:32

I promised in a post last month that I'd write some more about the PrimeGrid project, and it so happened this week that we made a discovery which gives me a good excuse to blog! On 31st October 2016 at 22:13:54 UTC a computer owned by Péter Szabolcs of Hungary reported via the BOINC distributed computing software that the number 10223*231172165+1 was prime.

Found: new world record Twin Primes!

Author: Iain Bethune
Posted: 29 Sep 2016 | 13:55

PrimeGrid logo

Number Theory - the study of the integers - is perhaps one of the purest branches of maths and is not well-known for setting the headlines alight.

Along with the proof of Fermat's Last Theorem in 1995, which earned a knighthood for Sir Andrew Wiles, there was a lot of excitement about the Twin Prime Conjecture a few years ago, beginning a new spurt of progress towards the solution of this thorny mathematical problem.

Volunteer computing & the hunt for prime numbers

Author: Iain Bethune
Posted: 29 Sep 2014 | 15:52

As well as helping out with our drop-in workshop at the British Science Festival in early September, I also had the chance to give a talk as part of the Festival's public lecture programme. Over 75 people turned out early on Sunday morning to hear 'Seventeen or Bust: Solving hard mathematical problems with your help!', where I explained how the PrimeGrid project is working on a solution to Sierpinski's conjecture, a fifty-year-old unsolved problem in Number Theory, as well as finding record-sized prime numbers in the process.

Blog Archive