This is a deepzoom of the world’s largest known prime number.

Click to watch the DeepZoom in action.

Almost 17 and a half million digits. There are only 2 numbers that will divide in to it. One and itself. It’s incredible to think, that within the sheer vastness of this number, there is no other whole number that will divide in to it.

The record for a hand-calculated prime is 44 digits, in 1951. Before that, the largest known prime was 39 digits – and that record had stood for 75 years. If you use a modern-day computer-based primality proving programme such as Primo, it will give you the answer for that same 44 digit number the very instant you press the enter key.

That same year, 1951, an electronic computer found a 79 digit prime. In 1952, using a Standard Western Automatic Computer, Raphael Robinson found a rash of new primes, even finding 2 on the same day. You can see some of them here in the DeepZoom – primes M607 and M1279.

Those of us with an interest in computer history might recognise the names of the computers that were used over the next few years to discover primes: the Swedish BESK; an IBM 7090, the ILLIAC-2, the IBM360.

Progress continued and of course the sophistication of the computers increased. From the late 70s until 1996, the space was dominated by the Cray Supercomputer, but it’s funny how things took a big jump from the Cray T94 Supercomputer in 1996 with a 378,632 digit discovery to the desktop PC with a Pentium chip calculating a 420,921 digit prime the very same year. It’s incredible to think that Amazon went online in 1995 and back then, we hadn’t even got as far as half a million digits with prime discoveries despite over a decade of supercomputer involvement.

Steady progress has been made since then with a scheme known as the Great Internet Mersenne Prime Search which is essentially a crowd-sourced solution to the problem. A very specific type of prime is searched for, known as a Mersenne Prime, by anybody who’d like to donate the idle time on their computer to the task.

Mersenne Primes are numbers of the form 2^{p}-1, where p is prime. Most of the big discoveries are Mersenne Primes. Using this method leaves huge unexplored areas in the number space between the Mersennes. We have christened these numbers the “Lost Primes”.

This unexplored space is the target of The Prime Challenge……..

There is a problem: the unexplored areas of the number-space. And there are resources to solve the problem – cloud computers running in Windows Azure. They are available free for 30 days, for anybody who’d like to be part of the challenge. Whether you are going to take the BigData or BigCompute approach to solving the problem with your own solution, or just follow the 5-step process, provision some servers to run in the cloud and use some of the free tools used by academics to help you, you might discover the biggest lost-prime and win the challenge.

This means you can take part in this challenge if you want to use the Infrastructure Services (IaaS) or the Platform Services (PaaS) features of Windows Azure. You can take part if you are an IT Pro, a Developer, a maths-head or just somebody interested in maths, science and technology. If you haven’t got a clue how to get started, follow the 5-step process. You have as much chance as anyone of winning the challenge. If you are a BigData maths-head with a view on how to use HDInsight to solve this problem, there’s nothing stopping you either. And if you sit somewhere in between those 2 extremes, you are also catered for – and – you could win.

Prime Numbers:

We all know a prime number is any number greater than one that is divisible only by itself and one. It starts with 2 then 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 and so on. There is no known pattern to the distribution of these numbers other than the prime distribution. Nobody has yet devised a prime prediction algorithm.

Primes are the building blocks of all other numbers. Every number can be uniquely decomposed in to prime numbers in a unique way. For example 2012 is equal to 2 times 2 times 503.

2 and 503 are prime numbers. This notion works with every number. 1 is not a prime number. It’s not a prime because you lose the uniqueness. For example, we can attach as many one as we like in this calculation and not impact the result (1 * 1 * 1 * 1 * 1 * 2 * 2 * 503).

What’s the biggest prime number? 2 and a half thousand years ago, Euclid proved there is no maximum prime. There is an infinite number of primes. But the biggest **known** prime, the one which is over 17 million digits, is two to the power of fifty seven million, eight hundred and eighty five thousand, one hundred and sixty one - minus 1 (2^{57885161}-1).

This is a special number called a Mersenne Prime, named after a 16^{th} Century Monk who was a theologian, philosopher, music theorist and mathematicion, though many disagree about his fame as a mathematician. He wrote a complete list of Mersenne Primes but he’d missed some numbers that were prime and added some that weren’t prime and he thought it was a finite list – which most people disagree with now. The hunt for the largest ever primes tends to concentrate on Mersenne Primes.

In the 17^{th} century Fermat, famous for his last theorem also tried to create a prime prediction formula. He said you take a number, n and you take 2 to the power of n and raise 2 to the power of that and add 1 (Fn=2^2^{n} + 1).

2 to the power 1 is 2, 2 to the power 2 is 4, add one and you get 5 – which is prime.

2 to the power 2 is 4, 2 to the power 4 is 16, add one and you get 17 – which is prime.

2 to the power 3 is 8, 2 to the power 8 is 256, add one and you get 257 – which is prime.

2 to the power 4 is 16, 2 to the power 16 is 65,536, add one and you get 65,537 – which is prime

Remember this was the 17^{th} Century – so checking if the **next** one is prime will make your eyes water:

2 to the power 5 is 32, 2 to the power 32 is 4 billion, 294 million, 967 thousand, 2 hundred and 96 (4294967296), add one and you get 4 billion, 294 million, 967 thousand, 2 hundred and 9**7** – is that prime or not? Fermat couldn’t answer that question in the 17^{th} century.

But about a hundred years later, Euler came along and said “4 billion, 294 million, 967 thousand, 2 hundred and 97 is equal to 641 multiplied by 6 million, seven hundred thousand, 4 hundred and seventeen. So it’s not prime.

After that, the numbers get very big very quickly. Computers have since proven that rather a lot of the subsequent Fermat numbers are also not prime. Just because the first few seem to indicate a pattern it doesn’t provide a proof.

EN quoi consiste le défi ?

trouvER les suivants dans l'ordre ?

je pense qu'il existe beaucoup de programme sur le net capable de le faire , mais ils travaillent par probabilité......pas moi !

Voici les 17 suivants dans l'ordre et il n'en manque pas un après 4294967296

4294967311

4294967357

4294967371

4294967377

4294967387

4294967389

4294967359

4294967377

4294967497

4294967513

4294967539

4294967543

4294967549

4294967561

4294967563

4294967569

4294967597

.........

.........

Ceci grâce à un nouvel algorithme encore inconnu,

depuis peu, je certifie connaitre la solution des nombres premiers " approuvé" par un professeur d'université qui est prêt à nous publier; Sur ces conseils, je me suis unis à mon cousin informaticien pour construire le programme qui certifiait l'authenticité de la découverte .

Le problème de la publication est qu'il paraît que je ne posséderais plus les droits d'auteur...

ce qui me gêne un petit peu.

Mon ordinateur me permet d'aller jusqu'à 9006999999999907 .

Pour info celui-ci est premier calculé en34 SECONDES.

Cela, sans me tromper d'un seul nombre premier " PC portable centrino duo 1ghz siemens de 5 ans "

Si vous avez une idée, nous cherchons un moyens de faire connaître notre programme ...

Bien à Vous

SEBASTIEN

sebnkat@gmail.com

Je doit corriger

Je me suis rendu compte d'une petite erreur de frappe !!

CORRECTION

ce n'est pas:

4294967359 4294967459

mais

4294967377 4294967477

Voici

bien à vous

Sébastien

How can I hand in what I think is the biggest prime

i find the algoritm to find all prime numbers very fast

and i'm going to win all competitions and money with a supercalculator

We are happy to use the blog services and happy to get the information from your essaywrite blog.

So these are all very providing best essay writing services and more content writing services for me.

Some interesting facts and puzzles about Prime Numbers and Magic Squares, Smith Numbers, and Arithmetic and Palindromic Primes on this blog: http://www.glennwestmore.com.au.

# nombres premiers

# 2016 03 philippe crogiez creation crogiez@yahoo.fr

function ecrit_log($llogf){

#rem create log

$llog=get-date -Format "yyyy-MM-dd-HH-mm-ss"

$llog=$llog+";"+$llogf

$llog

$llog >> $malog

}

function cherch_prem(){

#cherch_prem $debut_cherch $suivant

"cherch_prem deb"

$arr_npf=$arr_cherch_prem[0]

"nombres de premiers="+$arr_npf.count

$suivantf=$arr_cherch_prem[1]

$suivantf

#on cherche si nombre suivant est premier

$suppose=$arr_cherch_prem[1]

"suppose="+$suppose

#ne doit pas etre divisible par les premiers existants

$premier=1

$arr_npf | % {

$npp=$_

$div1=$suppose/$npp

""+$suppose+" / "+$npp+" = "+$div1

$ent=[math]::Round($div1)

if(($npp -ne 1) -and ($div1 -eq $ent)){"non premier"; $premier=0}

}

"premier"+$premier

"cherch_prem fin"

$arr_cherch_prem[2]=$premier

}

#recuperation du dossier courant

$monchemin=$MyInvocation.InvocationName

$monchemin

$mondossier=(split-path -Path $monchemin -Parent) + ""

$mondossier

$monscript=split-path -path $monchemin -leaf

$monscript

$malog=$mondossier+$monscript.Substring(0,$monscript.IndexOf("."))+".log"

$malog

$moncsv=$mondossier+$monscript.Substring(0,$monscript.IndexOf("."))+".csv"

$moncsv

#rem create log

$mlog="--------------"; ecrit_log($mlog)

$mlog=$monchemin; ecrit_log($mlog)

$arr_np=(1,2,3,5)

$l="" ; $arr_np | % { $l=$l+$_.tostring()+";"} ; $l

"nombre de premier="+$arr_np.Count

$suivant=$arr_np[($arr_np.Count-1)]+1

"cherche si suivant premier:"+$suivant

$retour=0

$arr_cherch_prem=($arr_np,$suivant,$retour)

cherch_prem

"apres fonction"

$retour=$arr_cherch_prem[2]

"retour="+$retour

$continue=1

while ($continue -eq 1){

if($retour -eq 0){

"premier non"

$suivant=$suivant+1

"cherche si suivant premier:"+$suivant

$retour=0

$arr_cherch_prem=($arr_np,$suivant,$retour)

cherch_prem

"apres fonction"

$retour=$arr_cherch_prem[2]

"retour="+$retour

}else{

"suivant est premier"

$arr_np+=$suivant

$arr_np.Count

$l="" ; $arr_np | % { $l=$l+$_.tostring()+";"} ; $l

$moncsv=$mondossier+"premiers.csv"

$moncsv

$l > $moncsv

type $moncsv

$suivant=$suivant+1

"cherche si suivant premier:"+$suivant

$retour=0

$arr_cherch_prem=($arr_np,$suivant,$retour)

cherch_prem

"apres fonction"

$retour=$arr_cherch_prem[2]

"retour="+$retour

}

}

#rem fin log

$mlog="end"; ecrit_log($mlog)