HOME
*





Double Mersenne Number
In mathematics, a double Mersenne number is a Mersenne number of the form :M_ = 2^-1 where ''p'' is prime. Examples The first four terms of the sequence of double Mersenne numbers areChris Caldwell''Mersenne Primes: History, Theorems and Lists''at the Prime Pages. : :M_ = M_3 = 7 :M_ = M_7 = 127 :M_ = M_ = 2147483647 :M_ = M_ = 170141183460469231731687303715884105727 Double Mersenne primes A double Mersenne number that is prime is called a double Mersenne prime. Since a Mersenne number ''M''''p'' can be prime only if ''p'' is prime, (see Mersenne prime for a proof), a double Mersenne number M_ can be prime only if ''M''''p'' is itself a Mersenne prime. For the first values of ''p'' for which ''M''''p'' is prime, M_ is known to be prime for ''p'' = 2, 3, 5, 7 while explicit factors of M_ have been found for ''p'' = 13, 17, 19, and 31. Thus, the smallest candidate for the next double Mersenne prime is M_, or 22305843009213693951 − 1. Being approximately 1.695, this ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Eugène Charles Catalan
Eugène Charles Catalan (30 May 1814 – 14 February 1894) was a French and Belgian mathematician who worked on continued fractions, descriptive geometry, number theory and combinatorics. His notable contributions included discovering a periodic minimal surface in the space \mathbb^3; stating the famous Catalan's conjecture, which was eventually proved in 2002; and, introducing the Catalan number to solve a combinatorial problem. Biography Catalan was born in Bruges (now in Belgium, then under Dutch rule even though the Kingdom of the Netherlands had not yet been formally instituted), the only child of a French jeweller by the name of Joseph Catalan, in 1814. In 1825, he traveled to Paris and learned mathematics at École Polytechnique, where he met Joseph Liouville (1833). In December 1834 he was expelled along with most of the students in his year for political reasons; he resumed his studies in January 1835, graduated that summer, and went on to teach at Châlons-sur-Marne. ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Édouard Lucas
__NOTOC__ François Édouard Anatole Lucas (; 4 April 1842 – 3 October 1891) was a French mathematician. Lucas is known for his study of the Fibonacci sequence. The related Lucas sequences and Lucas numbers are named after him. Biography Lucas was born in Amiens and educated at the École Normale Supérieure. He worked in the Paris Observatory and later became a professor of mathematics at the Lycée Saint Louis and the Lycée Charlemagne in Paris. Lucas served as an artillery officer in the French Army during the Franco-Prussian War of 1870–1871. In 1875, Lucas posed a challenge to prove that the only solution of the Diophantine equation: :\sum_^ n^2 = M^2\; with ''N'' > 1 is when ''N'' = 24 and ''M'' = 70. This is known as the cannonball problem, since it can be visualized as the problem of taking a square arrangement of cannonballs on the ground and building a square pyramid out of them. It was not until 1918 that a proof (using elliptic functions) was found for t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Wieferich Prime
In number theory, a Wieferich prime is a prime number ''p'' such that ''p''2 divides , therefore connecting these primes with Fermat's little theorem, which states that every odd prime ''p'' divides . Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's Last Theorem, at which time both of Fermat's theorems were already well known to mathematicians. Since then, connections between Wieferich primes and various other topics in mathematics have been discovered, including other types of numbers and primes, such as Mersenne and Fermat numbers, specific types of pseudoprimes and some types of numbers generalized from the original definition of a Wieferich prime. Over time, those connections discovered have extended to cover more properties of certain prime numbers as well as more general subjects such as number fields and the ''abc'' conjecture. , the only known Wieferich primes are 1093 and 3511 . Equivalent definitions The stronger v ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Perfect Number
In number theory, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. For instance, 6 has divisors 1, 2 and 3 (excluding itself), and 1 + 2 + 3 = 6, so 6 is a perfect number. The sum of divisors of a number, excluding the number itself, is called its aliquot sum, so a perfect number is one that is equal to its aliquot sum. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors including itself; in symbols, \sigma_1(n)=2n where \sigma_1 is the sum-of-divisors function. For instance, 28 is perfect as 1 + 2 + 4 + 7 + 14 = 28. This definition is ancient, appearing as early as Euclid's ''Elements'' (VII.22) where it is called (''perfect'', ''ideal'', or ''complete number''). Euclid also proved a formation rule (IX.36) whereby q(q+1)/2 is an even perfect number whenever q is a prime of the form 2^p-1 for positive integer p—what is now called a Mersenne prime. Two millennia ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Fermat Number
In mathematics, a Fermat number, named after Pierre de Fermat, who first studied them, is a positive integer of the form :F_ = 2^ + 1, where ''n'' is a non-negative integer. The first few Fermat numbers are: : 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, ... . If 2''k'' + 1 is prime and ''k'' > 0, then ''k'' must be a power of 2, so 2''k'' + 1 is a Fermat number; such primes are called Fermat primes. , the only known Fermat primes are ''F''0 = 3, ''F''1 = 5, ''F''2 = 17, ''F''3 = 257, and ''F''4 = 65537 ; heuristics suggest that there are no more. Basic properties The Fermat numbers satisfy the following recurrence relations: : F_ = (F_-1)^+1 : F_ = F_ \cdots F_ + 2 for ''n'' ≥ 1, : F_ = F_ + 2^F_ \cdots F_ : F_ = F_^2 - 2(F_-1)^2 for ''n'' ≥ 2. Each of these relations can be proved by mathematical induction. From the second equation, we can deduce Goldbach's theorem (named after Christian Goldbach): no two Fermat numbers share a common integer factor ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Double Exponential Function
A double exponential function is a constant raised to the power of an exponential function. The general formula is f(x) = a^=a^ (where ''a''>1 and ''b''>1), which grows much more quickly than an exponential function. For example, if ''a'' = ''b'' = 10: *''f''(x) = 1010x *''f''(0) = 10 *''f''(1) = 1010 *''f''(2) = 10100 = googol *''f''(3) = 101000 *''f''(100) = 1010100 = googolplex. Factorials grow faster than exponential functions, but much more slowly than doubly exponential functions. However, tetration and the Ackermann function grow faster. See Big O notation for a comparison of the rate of growth of various functions. The inverse of the double exponential function is the double logarithm log(log(''x'')). Doubly exponential sequences A sequence of positive integers (or real numbers) is said to have ''doubly exponential rate of growth'' if the function giving the th term of the sequence is bounded above and below by doubly exponential functions of . Examples include * The ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Cunningham Chain
In mathematics, a Cunningham chain is a certain sequence of prime numbers. Cunningham chains are named after mathematician A. J. C. Cunningham. They are also called chains of nearly doubled primes. Definition A Cunningham chain of the first kind of length ''n'' is a sequence of prime numbers (''p''1, ..., ''p''''n'') such that ''p''''i''+1 = 2''p''''i'' + 1 for all 1 â‰¤ ''i'' < ''n''. (Hence each term of such a chain except the last is a , and each term except the first is a ). It follows that : \begin p_2 & = 2p_1+1, \\ p_3 & = 4p_1+3, \\ p_4 & = 8p_1+7, \\ & \ \vdots \\ p_i & = 2^p_1 + (2^-1), \end or, by setting a = \frac (the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Goldbach Conjecture
Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum of two prime numbers. The conjecture has been shown to hold for all integers less than 4 Ã— 1018, but remains unproven despite considerable effort. History On 7 June 1742, the German mathematician Christian Goldbach wrote a letter to Leonhard Euler (letter XLIII), in which he proposed the following conjecture: Goldbach was following the now-abandoned convention of considering 1 to be a prime number, so that a sum of units would indeed be a sum of primes. He then proposed a second conjecture in the margin of his letter, which implies the first: Euler replied in a letter dated 30 June 1742 and reminded Goldbach of an earlier conversation they had had (), in which Goldbach had remarked that the first of those two conjectures would follow from the statement This is in fact equivalent to ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


The Beast With A Billion Backs
''Futurama: The Beast with a Billion Backs'' is a 2008 American direct-to-video adult animated science-fiction comedy-adventure film based on the animated series ''Futurama'', and the second of four straight-to-DVD films that make up the show's fifth season. The film was released in the United States and Canada on June 24, 2008, followed by a UK release on June 30, 2008 and an Australian release on August 6, 2008. The title refers to a euphemism for sexual intercourse—" the beast with two backs". Comedy Central aired the film as a "four-part epic" on October 19, 2008. The movie won an Annie Award for "Best Animated Home Entertainment Production". Plot A month after the universe was ripped open in ''Bender's Big Score'', people decide to go on with their lives. Amy and Kif get married. Fry starts dating a girl named Colleen, but breaks up with her when he discovers she has many other boyfriends. At a conference, Professor Farnsworth proposes an expedition to investigate the ano ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Futurama
''Futurama'' is an American animated science fiction sitcom created by Matt Groening for the Fox Broadcasting Company. The series follows the adventures of the professional slacker Philip J. Fry, who is cryogenically preserved for 1000 years and revived on December 31, 2999. Fry finds work at an interplanetary delivery company, working alongside the one-eyed Leela and robot Bender. The series was envisioned by Groening in the mid-1990s while working on ''The Simpsons''; he brought David X. Cohen aboard to develop storylines and characters to pitch the show to Fox. Following its initial cancelation by Fox, ''Futurama'' began airing reruns on Cartoon Network's Adult Swim programming block, which lasted from 2003 to 2007. It was revived in 2007 as four direct-to-video films, the last of which was released in early 2009. Comedy Central entered into an agreement with 20th Century Fox Television to syndicate the existing episodes and air the films as 16 new, half-hour episodes, ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Composite Number
A composite number is a positive integer that can be formed by multiplying two smaller positive integers. Equivalently, it is a positive integer that has at least one divisor other than 1 and itself. Every positive integer is composite, prime, or the unit 1, so the composite numbers are exactly the numbers that are not prime and not a unit. For example, the integer 14 is a composite number because it is the product of the two smaller integers 2 ×  7. Likewise, the integers 2 and 3 are not composite numbers because each of them can only be divided by one and itself. The composite numbers up to 150 are: :4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 98, 99, 100, 102, 104, 105, 106, 108, 110, 111, 112, 114, 115, 116, 117, 118, 1 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Mersenne Number
In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form for some integer . They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If is a composite number then so is . Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form for some prime . The exponents which give Mersenne primes are 2, 3, 5, 7, 13, 17, 19, 31, ... and the resulting Mersenne primes are 3, 7, 31, 127, 8191, 131071, 524287, 2147483647, ... . Numbers of the form without the primality requirement may be called Mersenne numbers. Sometimes, however, Mersenne numbers are defined to have the additional requirement that be prime. The smallest composite Mersenne number with prime exponent ''n'' is . Mersenne primes were studied in antiquity because of their close connection to perfect numbers: the Euclid–Euler theorem ass ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]