
	Where results make sense

Topic: Fermat prime

Related Topics

Table of divisors

Prime number

Fermats last theorem

Primality test

Mersenne prime

Sierpinski number

Table of prime factors

Jacobi symbol

Gaussian integer

Pierre de Fermat

Integer factorization

Natural number

Divisor

Prime Number Shitting Bear

Fundamental theorem of algebra

In the News (Sat 6 Sep 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	Mersenne prime - Wikipedia, the free encyclopedia
		In mathematics, a Mersenne prime is a prime number that is one less than a power of two.
		Mersenne primes have a close connection to perfect numbers, which are numbers that are equal to the sum of their proper divisors.
		Historically, the study of Mersenne primes was motivated by this connection; in the 4th century BC Euclid demonstrated that if M is a Mersenne prime then M(M+1)/2 is a perfect number.
	en.wikipedia.org /wiki/Mersenne_prime (784 words)

	Pierre de Fermat (Site not responding. Last check: 2007-10-21)
		Pierre de Fermat (August 17, 1601 – January 12, 1665) was a French lawyer and amateur mathematician who is generally given minor credit for the development of modern calculus; in particular, for his work regarding tangents and stationary points.
		Fermat worked on number theory while preparing an edition of Diophantus, and the notes and comments thereon contained the numerous theorems of considerable elegance necessary to develop the theory of numbers.
		Fermat is famous for his "Enigma" that was an extension of Pythagorean Theorem, also known as Fermat's Last Theorem.
	www.sciencedaily.com /encyclopedia/pierre_de_fermat (255 words)

	Fermat prime - a Whatis.com definition (Site not responding. Last check: 2007-10-21)
		A Fermat prime is a Fermat number that is also a prime number.
		The term arises from the name of a 17th-Century French lawyer and mathematician, Pierre de Fermat, who first defined these numbers and noticed their significance.
		Fermat believed that all numbers of the above form are prime numbers; that is, that F
	whatis.techtarget.com /definition/0,,sid9_gci788478,00.html (249 words)

	Pierre Fermat --Great Minds, Great Thinkers
		Fermat worked on number theory while preparing an edition of
		Diophantus, and the notes and comments thereon contained the numerous theorems of considerable elegance necessary to develop the theory of numbers.
		René Descartes, Fermat was one of the two leading mathematicians of the first half of the
	www.edinformatics.com /great_thinkers/fermat.htm (137 words)

	WIFC (World Integer Factorization Center)
		PPSIQS is the double large primes procedure variation of the self-intializing quadratic sieve.
		But it is not apparent that these numbers are prime or not.
		It is not obvious that these numbers can be factorized or not.
	www.asahi-net.or.jp /~KC2H-MSM/mathland/matha1 (1762 words)

	Internet-based Distributed Computing Projects - Active Projects
		Search for the next prime of the form n!+1 using primeform.
		There is a $500 (US) prize for the people who discover a new pair of Double Wieferich prime numbers.
		Find generalized Fermat prime numbers in the Generalized Fermat Prime Search.
	distributedcomputing.info /distrib-2001/distrib-projects.html (4255 words)

	Yves Gallot's Proth Search Page
		Yves Gallot wrote an excellent Win98/NT4.0/ME/XP program which makes it easy for anyone to find record size or otherwise interesting primes, but this creates a problem: without a coordinated effort, many of us were be searching the same ranges of numbers for primes!
		Some spent hundreds of hours checking ranges that were already known to be barren.
		Here are some links to other prime searches:
	prothsearch.net (261 words)

Try your search on: Qwika (all wikis)