185 relations: AKS primality test, Allan J. C. Cunningham, André Gérardin, Édouard Lucas, Bernoulli number, BESK, Binomial number, Bryant Tuckerman, Carol number, Centered nonagonal number, Circular prime, CN-group, Cornwall Colts, Cunningham number, Cunningham project, Curtis Cooper (mathematician), Data compaction, David Slowinski, Derrick Henry Lehmer, Donald B. Gillies, Double Mersenne number, Duodecimal, Eisenstein prime, Elementary cellular automaton, Elliptic curve primality, Elliptic-curve cryptography, Entropia, Inc., Erdős–Borwein constant, Euclid, Euclid–Euler theorem, Experimental mathematics, Fürer's algorithm, Fermat number, Fermat pseudoprime, FLOPS, Frank Nelson Cole, Friendly number, Generating primes, George Woltman, Gigantic prime, Gillies' conjecture, Great Internet Mersenne Prime Search, Hans Riesel, Happy number, Harry L. Nelson, Hexagonal number, History of computing hardware, Holographic algorithm, IBM 7090, ILLIAC, ..., ILLIAC II, Indian Institute of Technology Roorkee, Integer sequence prime, Ivan Pervushin, Jacobi symbol, Jens Franke, June 1949, Kynea number, Lagrange's theorem (group theory), Landon Curt Noll, Large numbers, Largest known prime number, Lehmer random number generator, Leonhard Euler, Liber Abaci, Linear congruential generator, List of distributed computing projects, List of Hockey Heritage North Honoured Members, List of logarithmic identities, List of long mathematical proofs, List of number theory topics, List of numbers, List of OEIS sequences, List of perfect numbers, List of prime numbers, List of things named after Leonhard Euler, List of unsolved problems in mathematics, Lucas sequence, Lucas test, Lucas–Lehmer primality test, Lucas–Lehmer–Riesel test, M36, M40, M41, M42, M43, M44, M45, M46, M47, M48, M49, Manchester Mark 1, Marin Mersenne, Megaprime, Mersenne conjectures, Mersenne Twister, Multiplication algorithm, On-Line Encyclopedia of Integer Sequences, Orders of magnitude (numbers), Palindromic number, Palindromic prime, Pandigital number, Paul Gage, Paul T. Bateman, Perfect number, Permutable prime, Pernicious number, Peter Barlow (mathematician), Pierpont prime, Polite number, Power of two, Prime number, Prime95, Primecoin, Primitive polynomial (field theory), Proth number, Proth's theorem, Quasi-opportunistic supercomputing, Ralph Ernest Powers, Ramanujan–Nagell equation, Raphael M. Robinson, Repdigit, Repunit, Richard P. Brent, Safe prime, Scholz conjecture, Scott Kurowski, Self number, Semiperfect number, Seventeen or Bust, Solinas prime, Sophie Germain prime, Special number field sieve, Strobogrammatic number, Supercomputer, Superperfect number, SWAC (computer), The Housekeeper and the Professor, The Intimate P. D. Q. Bach, Timeline of computational mathematics, Titanic prime, Triangular number, Trygve Nagell, Unique prime, Universal hashing, University of Central Missouri, Wheat and chessboard problem, Wieferich prime, Wilhelm Ljunggren, Woodall number, 1,000,000,000, 10,000,000, 100,000, 107 (number), 11 (number), 127 (number), 1588 in science, 17 (number), 1772 in science, 1876 in science, 19 (number), 1903 in science, 1925–26 Toronto St. Patricks season, 2, 2,147,483,647, 2000 (number), 2005 in the United States, 2006 in science, 255 (number), 28 (number), 3, 31 (number), 4000 (number), 496 (number), 5, 500 (number), 6, 61 (number), 63 (number), 64 (number), 7, 8000 (number), 8128 (number), 89 (number). Expand index (135 more) »

## AKS primality test

The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in a paper titled "PRIMES is in P".

New!!: Mersenne prime and AKS primality test · See more »

## Allan J. C. Cunningham

Allan Joseph Champneys Cunningham (1842 – 1928) was a British mathematician.

New!!: Mersenne prime and Allan J. C. Cunningham · See more »

## André Gérardin

André Gérardin (1879, Nancy, Meurthe-et-Moselle – 1953, Nancy, Meurthe-et-Moselle) was a French mathematician, specializing in number theory and calculating machines used in factoring large positive integers, finding primes, and calculating quadratic residues modulo a given positive integer.

New!!: Mersenne prime and André Gérardin · See more »

## Édouard Lucas

François Édouard Anatole Lucas (4 April 1842 – 3 October 1891) was a French mathematician.

New!!: Mersenne prime and Édouard Lucas · See more »

## Bernoulli number

In mathematics, the Bernoulli numbers are a sequence of rational numbers which occur frequently in number theory.

New!!: Mersenne prime and Bernoulli number · See more »

## BESK

BESK (Binär Elektronisk SekvensKalkylator, Swedish for "Binary Electronic Sequence Calculator") was Sweden's first electronic computer, using vacuum tubes instead of relays.

New!!: Mersenne prime and BESK · See more »

## Binomial number

In mathematics, specifically in number theory, a binomial number is an integer which can be obtained by evaluating a homogeneous polynomial containing two terms.

New!!: Mersenne prime and Binomial number · See more »

## Bryant Tuckerman

Louis Bryant Tuckerman, III (November 28, 1915 – May 19, 2002) was an American mathematician, born in Lincoln, Nebraska.

New!!: Mersenne prime and Bryant Tuckerman · See more »

## Carol number

A Carol number is an integer of the form 4^n - 2^ - 1.

New!!: Mersenne prime and Carol number · See more »

## Centered nonagonal number

A centered nonagonal number is a centered figurate number that represents a nonagon with a dot in the center and all other dots surrounding the center dot in successive nonagonal layers.

New!!: Mersenne prime and Centered nonagonal number · See more »

## Circular prime

A circular prime is a prime number with the property that the number generated at each intermediate step when cyclically permuting its (base 10) digits will be prime.

New!!: Mersenne prime and Circular prime · See more »

## CN-group

In mathematics, in the area of algebra known as group theory, a more than fifty-year effort was made to answer a conjecture of: are all groups of odd order solvable? Progress was made by showing that CA-groups, groups in which the centralizer of a non-identity element is abelian, of odd order are solvable.

New!!: Mersenne prime and CN-group · See more »

## Cornwall Colts

The Cornwall Colts are a Canadian junior ice hockey team from Cornwall, Ontario, Canada.

New!!: Mersenne prime and Cornwall Colts · See more »

## Cunningham number

In mathematics, specifically in number theory, a Cunningham number is a certain kind of integer named after English mathematician A. J. C. Cunningham.

New!!: Mersenne prime and Cunningham number · See more »

## Cunningham project

The Cunningham project is a project, started in 1925, to factor numbers of the form bn ± 1 for b.

New!!: Mersenne prime and Cunningham project · See more »

## Curtis Cooper (mathematician)

Curtis Niles Cooper is an American mathematician.

New!!: Mersenne prime and Curtis Cooper (mathematician) · See more »

## Data compaction

In telecommunication, data compaction is the reduction of the number of data elements, bandwidth, cost, and time for the generation, transmission, and storage of data without loss of information by eliminating unnecessary redundancy, removing irrelevancy, or using special coding.

New!!: Mersenne prime and Data compaction · See more »

## David Slowinski

David Slowinski is a mathematician involved in prime numbers.

New!!: Mersenne prime and David Slowinski · See more »

## Derrick Henry Lehmer

Derrick Henry "Dick" Lehmer (February 23, 1905 – May 22, 1991) was an American mathematician who refined Édouard Lucas' work in the 1930s and devised the Lucas–Lehmer test for Mersenne primes.

New!!: Mersenne prime and Derrick Henry Lehmer · See more »

## Donald B. Gillies

Donald Bruce Gillies (October 15, 1928 – July 17, 1975) was a Canadian mathematician and computer scientist, known for his work in game theory, computer design, and minicomputer programming environments.

New!!: Mersenne prime and Donald B. Gillies · See more »

## Double Mersenne number

In mathematics, a double Mersenne number is a Mersenne number of the form where p is a prime exponent.

New!!: Mersenne prime and Double Mersenne number · See more »

## Duodecimal

The duodecimal system (also known as base 12 or dozenal) is a positional notation numeral system using twelve as its base.

New!!: Mersenne prime and Duodecimal · See more »

## Eisenstein prime

In mathematics, an Eisenstein prime is an Eisenstein integer that is irreducible (or equivalently prime) in the ring-theoretic sense: its only Eisenstein divisors are the units, itself and its associates.

New!!: Mersenne prime and Eisenstein prime · See more »

## Elementary cellular automaton

In mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states (labeled 0 and 1) and the rule to determine the state of a cell in the next generation depends only on the current state of the cell and its two immediate neighbors.

New!!: Mersenne prime and Elementary cellular automaton · See more »

## Elliptic curve primality

In mathematics elliptic curve primality testing techniques are among the quickest and most widely used methods in primality proving.

New!!: Mersenne prime and Elliptic curve primality · See more »

## Elliptic-curve cryptography

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields.

New!!: Mersenne prime and Elliptic-curve cryptography · See more »

## Entropia, Inc.

Entropia, Inc. was a company founded in 1997 that sold distributed computing software for CPU scavenging.

New!!: Mersenne prime and Entropia, Inc. · See more »

## Erdős–Borwein constant

The Erdős–Borwein constant is the sum of the reciprocals of the Mersenne numbers.

New!!: Mersenne prime and Erdős–Borwein constant · See more »

## Euclid

Euclid (Εὐκλείδης Eukleidēs; fl. 300 BC), sometimes given the name Euclid of Alexandria to distinguish him from Euclides of Megara, was a Greek mathematician, often referred to as the "founder of geometry" or the "father of geometry".

New!!: Mersenne prime and Euclid · See more »

## Euclid–Euler theorem

The Euclid–Euler theorem is a theorem in mathematics that relates perfect numbers to Mersenne primes.

New!!: Mersenne prime and Euclid–Euler theorem · See more »

## Experimental mathematics

Experimental mathematics is an approach to mathematics in which computation is used to investigate mathematical objects and identify properties and patterns.

New!!: Mersenne prime and Experimental mathematics · See more »

## Fürer's algorithm

Fürer's algorithm is an integer multiplication algorithm for extremely large integers with very low asymptotic complexity.

New!!: Mersenne prime and Fürer's algorithm · See more »

## Fermat number

In mathematics a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form where n is a nonnegative integer.

New!!: Mersenne prime and Fermat number · See more »

## Fermat pseudoprime

In number theory, the Fermat pseudoprimes make up the most important class of pseudoprimes that come from Fermat's little theorem.

New!!: Mersenne prime and Fermat pseudoprime · See more »

## FLOPS

In computing, floating point operations per second (FLOPS, flops or flop/s) is a measure of computer performance, useful in fields of scientific computations that require floating-point calculations.

New!!: Mersenne prime and FLOPS · See more »

## Frank Nelson Cole

Frank Nelson Cole (September 20, 1861 – May 26, 1926) was an American mathematician, born in Ashland, Massachusetts, and educated at Harvard, where he lectured on mathematics from 1885 to 1887.

New!!: Mersenne prime and Frank Nelson Cole · See more »

## Friendly number

In number theory, friendly numbers are two or more natural numbers with a common abundancy index, the ratio between the sum of divisors of a number and the number itself.

New!!: Mersenne prime and Friendly number · See more »

## Generating primes

In computational number theory, a variety of algorithms make it possible to generate prime numbers efficiently.

New!!: Mersenne prime and Generating primes · See more »

## George Woltman

George Woltman (born November 10, 1957) is the founder of the Great Internet Mersenne Prime Search (GIMPS), a distributed computing project researching Mersenne prime numbers using his software Prime95 and MPrime.

New!!: Mersenne prime and George Woltman · See more »

## Gigantic prime

A gigantic prime is a prime number with at least 10,000 decimal digits.

New!!: Mersenne prime and Gigantic prime · See more »

## Gillies' conjecture

In number theory, Gillies' conjecture is a conjecture about the distribution of prime divisors of Mersenne numbers and was made by Donald B. Gillies in a 1964 paper in which he also announced the discovery of three new Mersenne primes.

New!!: Mersenne prime and Gillies' conjecture · See more »

## Great Internet Mersenne Prime Search

The Great Internet Mersenne Prime Search (GIMPS) is a collaborative project of volunteers who use freely available software to search for Mersenne prime numbers.

New!!: Mersenne prime and Great Internet Mersenne Prime Search · See more »

## Hans Riesel

Hans Ivar Riesel (May 28, 1929 in Stockholm – December 21, 2014) was a Swedish mathematician who discovered the 18th known Mersenne prime in 1957, using the computer BESK: this prime is 23217-1 and consists of 969 digits.

New!!: Mersenne prime and Hans Riesel · See more »

## Happy number

A happy number is defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits in base-ten, and repeat the process until the number either equals 1 (where it will stay), or it loops endlessly in a cycle that does not include 1.

New!!: Mersenne prime and Happy number · See more »

## Harry L. Nelson

Harry Lewis Nelson (born January 8, 1932) is an American mathematician and computer programmer.

New!!: Mersenne prime and Harry L. Nelson · See more »

## Hexagonal number

A hexagonal number is a figurate number.

New!!: Mersenne prime and Hexagonal number · See more »

## History of computing hardware

The history of computing hardware covers the developments from early simple devices to aid calculation to modern day computers.

New!!: Mersenne prime and History of computing hardware · See more »

## Holographic algorithm

In computer science, a holographic algorithm is an algorithm that uses a holographic reduction.

New!!: Mersenne prime and Holographic algorithm · See more »

## IBM 7090

The IBM 7090 is a second-generation transistorized version of the earlier IBM 709 vacuum tube mainframe computers that was designed for "large-scale scientific and technological applications".

New!!: Mersenne prime and IBM 7090 · See more »

## ILLIAC

ILLIAC (Illinois Automatic Computer) was a series of supercomputers built at a variety of locations, some at the University of Illinois at Urbana-Champaign.

New!!: Mersenne prime and ILLIAC · See more »

## ILLIAC II

The ILLIAC II was a revolutionary super-computer built by the University of Illinois that became operational in 1962.

New!!: Mersenne prime and ILLIAC II · See more »

## Indian Institute of Technology Roorkee

Indian Institute of Technology Roorkee (abbreviated IIT Roorkee or IITR), formerly University of Roorkee and Thomason College of Civil Engineering, is a public engineering university located in Roorkee, Uttarakhand, India.

New!!: Mersenne prime and Indian Institute of Technology Roorkee · See more »

## Integer sequence prime

In mathematics, an integer sequence prime is a prime number found as a member of an integer sequence.

New!!: Mersenne prime and Integer sequence prime · See more »

## Ivan Pervushin

Ivan Mikheevich Pervushin (Иван Михеевич Первушин, sometimes transliterated as Pervusin or Pervouchine) (—) was a Russian clergyman and mathematician of the second half of the 19th century, known for his achievements in number theory.

New!!: Mersenne prime and Ivan Pervushin · See more »

## Jacobi symbol

Jacobi symbol for various k (along top) and n (along left side).

New!!: Mersenne prime and Jacobi symbol · See more »

## Jens Franke

Jens Franke (born June 29, 1964) is a German mathematician.

New!!: Mersenne prime and Jens Franke · See more »

## June 1949

The following events occurred in June 1949.

New!!: Mersenne prime and June 1949 · See more »

## Kynea number

A Kynea number is an integer of the form An equivalent formula is This indicates that a Kynea number is the nth power of 4 plus the (n + 1)th Mersenne number.

New!!: Mersenne prime and Kynea number · See more »

## Lagrange's theorem (group theory)

Lagrange's theorem, in the mathematics of group theory, states that for any finite group G, the order (number of elements) of every subgroup H of G divides the order of G. The theorem is named after Joseph-Louis Lagrange.

New!!: Mersenne prime and Lagrange's theorem (group theory) · See more »

## Landon Curt Noll

Landon Curt Noll (born October 28, 1960) is an American computer scientist, co-discoverer of the 25th Mersenne prime and discoverer of the 26th, which he found while still enrolled at Hayward High School and concurrently at California State University, Hayward.

New!!: Mersenne prime and Landon Curt Noll · See more »

## Large numbers

Large numbers are numbers that are significantly larger than those ordinarily used in everyday life, for instance in simple counting or in monetary transactions.

New!!: Mersenne prime and Large numbers · See more »

## Largest known prime number

The largest known prime number is 277,232,917 − 1, a number with 23,249,425 digits.

New!!: Mersenne prime and Largest known prime number · See more »

## Lehmer random number generator

The Lehmer random number generator (named after D. H. Lehmer), sometimes also referred to as the Park–Miller random number generator (after Stephen K. Park and Keith W. Miller), is a type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The general formula is: where the modulus n is a prime number or a power of a prime number, the multiplier g is an element of high multiplicative order modulo n (e.g., a primitive root modulo n), and the seed X is coprime to n.

New!!: Mersenne prime and Lehmer random number generator · See more »

## Leonhard Euler

Leonhard Euler (Swiss Standard German:; German Standard German:; 15 April 170718 September 1783) was a Swiss mathematician, physicist, astronomer, logician and engineer, who made important and influential discoveries in many branches of mathematics, such as infinitesimal calculus and graph theory, while also making pioneering contributions to several branches such as topology and analytic number theory.

New!!: Mersenne prime and Leonhard Euler · See more »

## Liber Abaci

Liber Abaci (1202, also spelled as Liber Abbaci) is a historic book on arithmetic by Leonardo of Pisa, known later by his nickname Fibonacci.

New!!: Mersenne prime and Liber Abaci · See more »

## Linear congruential generator

A linear congruential generator (LCG) is an algorithm that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation.

New!!: Mersenne prime and Linear congruential generator · See more »

## List of distributed computing projects

This is a list of distributed computing and grid computing projects.

New!!: Mersenne prime and List of distributed computing projects · See more »

## List of Hockey Heritage North Honoured Members

This is a list of the Honoured Members of Hockey Heritage North.

New!!: Mersenne prime and List of Hockey Heritage North Honoured Members · See more »

## List of logarithmic identities

In mathematics, there are many logarithmic identities.

New!!: Mersenne prime and List of logarithmic identities · See more »

## List of long mathematical proofs

This is a list of unusually long mathematical proofs.

New!!: Mersenne prime and List of long mathematical proofs · See more »

## List of number theory topics

This is a list of number theory topics, by Wikipedia page.

New!!: Mersenne prime and List of number theory topics · See more »

## List of numbers

This is a list of articles about numbers (not about numerals).

New!!: Mersenne prime and List of numbers · See more »

## List of OEIS sequences

This article provides a list of integer sequences in the On-Line Encyclopedia of Integer Sequences that have their own English Wikipedia entries.

New!!: Mersenne prime and List of OEIS sequences · See more »

## List of perfect numbers

The following is a list of the known perfect numbers, and the exponents p that can be used to generate them (using the expression 2p−1× (2p − 1)) whenever 2p − 1 is a Mersenne prime.

New!!: Mersenne prime and List of perfect numbers · See more »

## List of prime numbers

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself.

New!!: Mersenne prime and List of prime numbers · See more »

## List of things named after Leonhard Euler

Leonhard Euler (1707–1783)In mathematics and physics, there are a large number of topics named in honor of Swiss mathematician Leonhard Euler (1707–1783), who made many important discoveries and innovations.

New!!: Mersenne prime and List of things named after Leonhard Euler · See more »

## List of unsolved problems in mathematics

Since the Renaissance, every century has seen the solution of more mathematical problems than the century before, and yet many mathematical problems, both major and minor, still remain unsolved.

New!!: Mersenne prime and List of unsolved problems in mathematics · See more »

## Lucas sequence

In mathematics, the Lucas sequences U_n(P,Q) and V_n(P, Q) are certain constant-recursive integer sequences that satisfy the recurrence relation where P and Q are fixed integers.

New!!: Mersenne prime and Lucas sequence · See more »

## Lucas test

Lucas test may refer to.

New!!: Mersenne prime and Lucas test · See more »

## Lucas–Lehmer primality test

In mathematics, the Lucas–Lehmer test (LLT) is a primality test for Mersenne numbers.

New!!: Mersenne prime and Lucas–Lehmer primality test · See more »

## Lucas–Lehmer–Riesel test

In mathematics, the Lucas–Lehmer–Riesel test is a primality test for numbers of the form N.

New!!: Mersenne prime and Lucas–Lehmer–Riesel test · See more »

## M36

M36, M-36 or M.36 may refer to.

New!!: Mersenne prime and M36 · See more »

## M40

M40 or M-40 may refer to: In transportation.

New!!: Mersenne prime and M40 · See more »

## M41

M41, M-41, or M.41 may refer to.

New!!: Mersenne prime and M41 · See more »

## M42

M42 or M-42 may refer to: In science.

New!!: Mersenne prime and M42 · See more »

## M43

M43 may refer to.

New!!: Mersenne prime and M43 · See more »

## M44

M44 or M-44 may refer to.

New!!: Mersenne prime and M44 · See more »

## M45

M45 or M-45 may refer to: In science.

New!!: Mersenne prime and M45 · See more »

## M46

M46 or M-46 may refer to.

New!!: Mersenne prime and M46 · See more »

## M47

M47 or M-47 may refer to.

New!!: Mersenne prime and M47 · See more »

## M48

M48 or M-48 may refer to.

New!!: Mersenne prime and M48 · See more »

## M49

M49, M.49 or M-49 may be.

New!!: Mersenne prime and M49 · See more »

## Manchester Mark 1

The Manchester Mark 1 was one of the earliest stored-program computers, developed at the Victoria University of Manchester from the Manchester Baby (operational in June 1948).

New!!: Mersenne prime and Manchester Mark 1 · See more »

## Marin Mersenne

Marin Mersenne, Marin Mersennus or le Père Mersenne (8 September 1588 – 1 September 1648) was a French polymath, whose works touched a wide variety of fields.

New!!: Mersenne prime and Marin Mersenne · See more »

## Megaprime

A megaprime is a prime number with at least one million decimal digits (whereas titanic prime is a prime number with at least 1,000 digits, and gigantic prime has at least 10,000 digits).

New!!: Mersenne prime and Megaprime · See more »

## Mersenne conjectures

In mathematics, the Mersenne conjectures concern the characterization of prime numbers of a form called Mersenne primes, meaning prime numbers that are a power of two minus one.

New!!: Mersenne prime and Mersenne conjectures · See more »

## Mersenne Twister

The Mersenne Twister is a pseudorandom number generator (PRNG).

New!!: Mersenne prime and Mersenne Twister · See more »

## Multiplication algorithm

A multiplication algorithm is an algorithm (or method) to multiply two numbers.

New!!: Mersenne prime and Multiplication algorithm · See more »

## On-Line Encyclopedia of Integer Sequences

The On-Line Encyclopedia of Integer Sequences (OEIS), also cited simply as Sloane's, is an online database of integer sequences.

New!!: Mersenne prime and On-Line Encyclopedia of Integer Sequences · See more »

## Orders of magnitude (numbers)

This list contains selected positive numbers in increasing order, including counts of things, dimensionless quantity and probabilities.

New!!: Mersenne prime and Orders of magnitude (numbers) · See more »

## Palindromic number

A palindromic number or numeral palindrome is a number that remains the same when its digits are reversed.

New!!: Mersenne prime and Palindromic number · See more »

## Palindromic prime

A palindromic prime (sometimes called a palprime) is a prime number that is also a palindromic number.

New!!: Mersenne prime and Palindromic prime · See more »

## Pandigital number

In mathematics, a pandigital number is an integer that in a given base has among its significant digits each digit used in the base at least once.

New!!: Mersenne prime and Pandigital number · See more »

## Paul Gage

Paul Gage is a research computer scientist who works at Cray Supercomputers.

New!!: Mersenne prime and Paul Gage · See more »

## Paul T. Bateman

Paul Trevier Bateman (June 6, 1919 – December 26, 2012) was an American number theorist, known for formulating the Bateman–Horn conjecture on the density of prime number values generated by systems of polynomials and the New Mersenne conjecture relating the occurrences of Mersenne primes and Wagstaff primes.

New!!: Mersenne prime and Paul T. Bateman · See more »

## Perfect number

In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also known as its aliquot sum).

New!!: Mersenne prime and Perfect number · See more »

## Permutable prime

A permutable prime, also known as anagrammatic prime, is a prime number which, in a given base, can have its digits' positions switched through any permutation and still be a prime number.

New!!: Mersenne prime and Permutable prime · See more »

## Pernicious number

In number theory, a pernicious number is a positive integer where the Hamming weight (or digit sum) of its binary representation is prime.

New!!: Mersenne prime and Pernicious number · See more »

## Peter Barlow (mathematician)

Peter Barlow (13 October 1776 – 1 March 1862)Lance Day and Ian McNeil, Biographical dictionary of the history of technology, Routledge, 1995, page 42.

New!!: Mersenne prime and Peter Barlow (mathematician) · See more »

## Pierpont prime

A Pierpont prime is a prime number of the form for some nonnegative integers and.

New!!: Mersenne prime and Pierpont prime · See more »

## Polite number

In number theory, a polite number is a positive integer that can be written as the sum of two or more consecutive positive integers.

New!!: Mersenne prime and Polite number · See more »

## Power of two

In mathematics, a power of two is a number of the form where is an integer, i.e. the result of exponentiation with number two as the base and integer as the exponent.

New!!: Mersenne prime and Power of two · See more »

## Prime number

A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.

New!!: Mersenne prime and Prime number · See more »

## Prime95

Prime95 is the freeware application written by George Woltman that is used by GIMPS, a distributed computing project dedicated to finding new Mersenne prime numbers.

New!!: Mersenne prime and Prime95 · See more »

## Primecoin

Primecoin (sign: Ψ; code: XPM) is a peer-to-peer open source cryptocurrency that implements a unique scientific computing proof-of-work system.

New!!: Mersenne prime and Primecoin · See more »

## Primitive polynomial (field theory)

In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF(pm).

New!!: Mersenne prime and Primitive polynomial (field theory) · See more »

## Proth number

In number theory, a Proth number, named after the mathematician François Proth, is a number of the form where k is an odd positive integer and n is a positive integer such that 2^n > k. Without the latter condition, all odd integers greater than 1 would be Proth numbers.

New!!: Mersenne prime and Proth number · See more »

## Proth's theorem

In number theory, Proth's theorem is a primality test for Proth numbers.

New!!: Mersenne prime and Proth's theorem · See more »

## Quasi-opportunistic supercomputing

Quasi-opportunistic supercomputing is a computational paradigm for supercomputing on a large number of geographically disperse computers.

New!!: Mersenne prime and Quasi-opportunistic supercomputing · See more »

## Ralph Ernest Powers

Ralph Ernest Powers (April 27, 1875 – January 31, 1952) was an American amateur mathematician who worked on prime numbers.

New!!: Mersenne prime and Ralph Ernest Powers · See more »

## Ramanujan–Nagell equation

In mathematics, in the field of number theory, the Ramanujan–Nagell equation is an equation between a square number and a number that is seven less than a power of two.

New!!: Mersenne prime and Ramanujan–Nagell equation · See more »

## Raphael M. Robinson

Raphael Mitchel Robinson (November 2, 1911 – January 27, 1995) was an American mathematician.

New!!: Mersenne prime and Raphael M. Robinson · See more »

## Repdigit

In recreational mathematics, a repdigit or sometimes monodigit is a natural number composed of repeated instances of the same digit in a positional number system (often implicitly decimal).

New!!: Mersenne prime and Repdigit · See more »

## Repunit

In recreational mathematics, a repunit is a number like 11, 111, or 1111 that contains only the digit 1 — a more specific type of repdigit.

New!!: Mersenne prime and Repunit · See more »

## Richard P. Brent

Richard Peirce Brent (born 20 April 1946, Melbourne) is an Australian mathematician and computer scientist.

New!!: Mersenne prime and Richard P. Brent · See more »

## Safe prime

A safe prime is a prime number of the form 2p + 1, where p is also a prime.

New!!: Mersenne prime and Safe prime · See more »

## Scholz conjecture

In mathematics, the Scholz conjecture is a conjecture on the length of certain addition chains.

New!!: Mersenne prime and Scholz conjecture · See more »

## Scott Kurowski

Scott Kurowski is an entrepreneurial software technologist and inventor.

New!!: Mersenne prime and Scott Kurowski · See more »

## Self number

A self number, Colombian number or Devlali number is an integer that cannot be written as the sum of any other integer n and the individual digits of n. This property is specific to the base used to represent the integers.

New!!: Mersenne prime and Self number · See more »

## Semiperfect number

In number theory, a semiperfect number or pseudoperfect number is a natural number n that is equal to the sum of all or some of its proper divisors.

New!!: Mersenne prime and Semiperfect number · See more »

## Seventeen or Bust

Seventeen or Bust was a distributed computing project started in March 2002 to solve the last seventeen cases in the Sierpinski problem.

New!!: Mersenne prime and Seventeen or Bust · See more »

## Solinas prime

In mathematics, a Solinas prime, or generalized mersenne prime, is a prime number that has the form f(2^m), where f(x) is a low-degree polynomial with small integer coefficients.

New!!: Mersenne prime and Solinas prime · See more »

## Sophie Germain prime

In number theory, a prime number p is a Sophie Germain prime if 2p + 1 is also prime.

New!!: Mersenne prime and Sophie Germain prime · See more »

## Special number field sieve

In number theory, a branch of mathematics, the special number field sieve (SNFS) is a special-purpose integer factorization algorithm.

New!!: Mersenne prime and Special number field sieve · See more »

## Strobogrammatic number

A strobogrammatic number is a number whose numeral is rotationally symmetric, so that it appears the same when rotated 180 degrees.

New!!: Mersenne prime and Strobogrammatic number · See more »

## Supercomputer

A supercomputer is a computer with a high level of performance compared to a general-purpose computer.

New!!: Mersenne prime and Supercomputer · See more »

## Superperfect number

In mathematics, a superperfect number is a positive integer n that satisfies where σ is the divisor summatory function.

New!!: Mersenne prime and Superperfect number · See more »

## SWAC (computer)

The SWAC (Standards Western Automatic Computer) was an early electronic digital computer built in 1950 by the U.S. National Bureau of Standards (NBS) in Los Angeles, California.

New!!: Mersenne prime and SWAC (computer) · See more »

## The Housekeeper and the Professor

(literally "The Professor's Beloved Equation") is a novel by Yoko Ogawa set in modern-day Japan.

New!!: Mersenne prime and The Housekeeper and the Professor · See more »

## The Intimate P. D. Q. Bach

The Intimate P. D. Q. Bach is "a live recording of The Intimate P.D.Q. Bach stage show, featuring Professor Peter Schickele and the Semi-Pro Musica Antiqua" and was released on Vanguard Records in 1974.

New!!: Mersenne prime and The Intimate P. D. Q. Bach · See more »

## Timeline of computational mathematics

This is a timeline of key developments in computational mathematics.

New!!: Mersenne prime and Timeline of computational mathematics · See more »

## Titanic prime

Titanic prime is a term coined by Samuel Yates in the 1980s, denoting a prime number of at least 1000 decimal digits.

New!!: Mersenne prime and Titanic prime · See more »

## Triangular number

A triangular number or triangle number counts objects arranged in an equilateral triangle, as in the diagram on the right.

New!!: Mersenne prime and Triangular number · See more »

## Trygve Nagell

Trygve Nagell (July 13, 1895 in Oslo – January 24, 1988 in Uppsala) was a Norwegian mathematician, known for his works on the Diophantine equations within number theory.

New!!: Mersenne prime and Trygve Nagell · See more »

## Unique prime

In recreational number theory, a unique prime or unique period prime is a certain kind of prime number.

New!!: Mersenne prime and Unique prime · See more »

## Universal hashing

In mathematics and computing universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below).

New!!: Mersenne prime and Universal hashing · See more »

## University of Central Missouri

The University of Central Missouri (UCM), formerly Central Missouri State University (CMSU), is a public state university located in Warrensburg, Missouri, United States.

New!!: Mersenne prime and University of Central Missouri · See more »

## Wheat and chessboard problem

The wheat and chessboard problem (sometimes expressed in terms of rice grains) is a mathematical problem expressed in textual form as: The problem may be solved using simple addition.

New!!: Mersenne prime and Wheat and chessboard problem · See more »

## Wieferich prime

In number theory, a Wieferich prime is a prime number p such that p2 divides, therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides.

New!!: Mersenne prime and Wieferich prime · See more »

## Wilhelm Ljunggren

Wilhelm Ljunggren (7 October 1905 – 25 January 1973) was a Norwegian mathematician, specializing in number theory.

New!!: Mersenne prime and Wilhelm Ljunggren · See more »

## Woodall number

In number theory, a Woodall number (Wn) is any natural number of the form for some natural number n. The first few Woodall numbers are.

New!!: Mersenne prime and Woodall number · See more »

## 1,000,000,000

1,000,000,000 (one billion, short scale; one thousand million or milliard, yard, long scale) is the natural number following 999,999,999 and preceding 1,000,000,001.

New!!: Mersenne prime and 1,000,000,000 · See more »

## 10,000,000

10,000,000 (ten million) is the natural number following 9,999,999 and preceding 10,000,001.

New!!: Mersenne prime and 10,000,000 · See more »

## 100,000

100,000 (one hundred thousand) is the natural number following 99,999 and preceding 100,001.

New!!: Mersenne prime and 100,000 · See more »

## 107 (number)

107 (one hundred seven) is the natural number following 106 and preceding 108.

New!!: Mersenne prime and 107 (number) · See more »

## 11 (number)

11 (eleven) is the natural number following 10 and preceding 12.

New!!: Mersenne prime and 11 (number) · See more »

## 127 (number)

127 (one hundred twenty-seven) is the natural number following 126 and preceding 128.

New!!: Mersenne prime and 127 (number) · See more »

## 1588 in science

The year 1588 in science and technology, Armada year, included a number of events, some of which are listed here.

New!!: Mersenne prime and 1588 in science · See more »

## 17 (number)

17 (seventeen) is the natural number following 16 and preceding 18.

New!!: Mersenne prime and 17 (number) · See more »

## 1772 in science

The year 1772 in science and technology involved some significant events.

New!!: Mersenne prime and 1772 in science · See more »

## 1876 in science

The year 1876 in science and technology involved some significant events, listed below.

New!!: Mersenne prime and 1876 in science · See more »

## 19 (number)

19 (nineteen) is the natural number following 18 and preceding 20.

New!!: Mersenne prime and 19 (number) · See more »

## 1903 in science

The year 1903 in science and technology involved some significant events, listed below.

New!!: Mersenne prime and 1903 in science · See more »

## 1925–26 Toronto St. Patricks season

The 1925–26 Toronto St.

New!!: Mersenne prime and 1925–26 Toronto St. Patricks season · See more »

## 2

2 (two) is a number, numeral, and glyph.

New!!: Mersenne prime and 2 · See more »

## 2,147,483,647

The number 2,147,483,647 is the eighth Mersenne prime, equal to 231 − 1.

New!!: Mersenne prime and 2,147,483,647 · See more »

## 2000 (number)

2000 (two thousand) is a natural number following 1999 and preceding 2001.

New!!: Mersenne prime and 2000 (number) · See more »

## 2005 in the United States

Events from the year 2005 in the United States.

New!!: Mersenne prime and 2005 in the United States · See more »

## 2006 in science

The year 2006 in science and technology involved some significant events.

New!!: Mersenne prime and 2006 in science · See more »

## 255 (number)

255 (two hundred fifty-five) is the natural number following 254 and preceding 256.

New!!: Mersenne prime and 255 (number) · See more »

## 28 (number)

28 (twenty-eight) is the natural number following 27 and preceding 29.

New!!: Mersenne prime and 28 (number) · See more »

## 3

3 (three) is a number, numeral, and glyph.

New!!: Mersenne prime and 3 · See more »

## 31 (number)

31 (thirty-one) is the natural number following 30 and preceding 32.

New!!: Mersenne prime and 31 (number) · See more »

## 4000 (number)

4000 (four thousand) is the natural number following 3999 and preceding 4001.

New!!: Mersenne prime and 4000 (number) · See more »

## 496 (number)

496 (four hundred ninety-six) is the natural number following 495 and preceding 497.

New!!: Mersenne prime and 496 (number) · See more »

## 5

5 (five) is a number, numeral, and glyph.

New!!: Mersenne prime and 5 · See more »

## 500 (number)

500 (five hundred) is the natural number following 499 and preceding 501.

New!!: Mersenne prime and 500 (number) · See more »

## 6

6 (six) is the natural number following 5 and preceding 7.

New!!: Mersenne prime and 6 · See more »

## 61 (number)

61 (sixty-one) is the natural number following 60 and preceding 62.

New!!: Mersenne prime and 61 (number) · See more »

## 63 (number)

63 (sixty-three) is a natural number following 62 and preceding 64.

New!!: Mersenne prime and 63 (number) · See more »

## 64 (number)

64 (sixty-four) is the natural number following 63 and preceding 65.

New!!: Mersenne prime and 64 (number) · See more »

## 7

7 (seven) is the natural number following 6 and preceding 8.

New!!: Mersenne prime and 7 · See more »

## 8000 (number)

8000 (eight thousand) is the natural number following 7999 and preceding 8001.

New!!: Mersenne prime and 8000 (number) · See more »

## 8128 (number)

8128 is the integer following 8127 and preceding 8129.

New!!: Mersenne prime and 8128 (number) · See more »

## 89 (number)

89 (eighty-nine) is the natural number following 88 and preceding 90.

New!!: Mersenne prime and 89 (number) · See more »

## Redirects here:

131071 (number), 2305843009213693951, 2305843009213693951 (number), 242643801-1, 2^42643801-1, 2^61-1, 2^n-1, 2ⁿ-1, 524287 (number), 8191 (number), E. Fauquembergue, Factorization of composite Mersenne numbers, Gordon Spence, Joel Armengaud, Josh Findley, List of Mersenne primes, Mersene prime, Mersenne Number, Mersenne Numbers, Mersenne Prime, Mersenne Prime Numbers, Mersenne Primes, Mersenne number, Mersenne numbers, Mersenne prime number, Mersenne prime numbers, Mersenne primes, Nayan Hajratwala, Pervushin's number, Roland Clarkson, Steven Boone.

## References

[1] https://en.wikipedia.org/wiki/Mersenne_prime