|
Wieferich Pair
In mathematics, a Wieferich pair is a pair of prime numbers ''p'' and ''q'' that satisfy :''p''''q'' − 1 ≡ 1 ( mod ''q''2) and ''q''''p'' − 1 ≡ 1 (mod ''p''2) Wieferich pairs are named after German mathematician Arthur Wieferich. Wieferich pairs play an important role in Preda Mihăilescu's 2002 proof of Mihăilescu's theorem (formerly known as Catalan's conjecture). Known Wieferich pairs There are only 7 Wieferich pairs known: :(2, 1093), (3, 1006003), (5, 1645333507), (5, 188748146801), (83, 4871), (911, 318917), and (2903, 18787). (sequence and in OEIS) Wieferich triple A Wieferich triple is a triple of prime numbers ''p'', ''q'' and ''r'' that satisfy :''p''''q'' − 1 ≡ 1 (mod ''q''2), ''q''''r'' − 1 ≡ 1 (mod ''r''2), and ''r''''p'' − 1 ≡ 1 (mod ''p''2). There are 17 known Wieferich triples: :(2, 1093, 5), (2, 3511, 73), (3, 11, 71), (3, 1006003, 3188089), (5, 20771, 18043), (5, 20771, 950507), (5, 53471161, 193), (5, 6692367337 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorization, factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow primality test, method of checking the primality of a given number , called trial division, tests whether is a multiple of any integer between 2 and . Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Arithmetic
In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book '' Disquisitiones Arithmeticae'', published in 1801. A familiar example of modular arithmetic is the hour hand on a 12-hour clock. If the hour hand points to 7 now, then 8 hours later it will point to 3. Ordinary addition would result in , but 15 reads as 3 on the clock face. This is because the hour hand makes one rotation every 12 hours and the hour number starts over when the hour hand passes 12. We say that 15 is ''congruent'' to 3 modulo 12, written 15 ≡ 3 (mod 12), so that 7 + 8 ≡ 3 (mod 12). Similarly, if one starts at 12 and waits 8 hours, the hour hand will be at 8. If one instead waited twice as long, 16 hours, the hour hand would be on 4. This ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Germany
Germany, officially the Federal Republic of Germany, is a country in Central Europe. It lies between the Baltic Sea and the North Sea to the north and the Alps to the south. Its sixteen States of Germany, constituent states have a total population of over 84 million in an area of , making it the most populous member state of the European Union. It borders Denmark to the north, Poland and the Czech Republic to the east, Austria and Switzerland to the south, and France, Luxembourg, Belgium, and the Netherlands to the west. The Capital of Germany, nation's capital and List of cities in Germany by population, most populous city is Berlin and its main financial centre is Frankfurt; the largest urban area is the Ruhr. Settlement in the territory of modern Germany began in the Lower Paleolithic, with various tribes inhabiting it from the Neolithic onward, chiefly the Celts. Various Germanic peoples, Germanic tribes have inhabited the northern parts of modern Germany since classical ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematician
A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, mathematical structure, structure, space, Mathematical model, models, and mathematics#Calculus and analysis, change. History One of the earliest known mathematicians was Thales of Miletus (); he has been hailed as the first true mathematician and the first known individual to whom a mathematical discovery has been attributed. He is credited with the first use of deductive reasoning applied to geometry, by deriving four corollaries to Thales's theorem. The number of known mathematicians grew when Pythagoras of Samos () established the Pythagorean school, whose doctrine it was that mathematics ruled the universe and whose motto was "All is number". It was the Pythagoreans who coined the term "mathematics", and with whom the study of mathematics for its own sake begins. The first woman math ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arthur Wieferich
Arthur Josef Alwin Wieferich (April 27, 1884 – September 15, 1954) was a German mathematician and teacher, remembered for his work on number theory, as exemplified by a type of prime numbers named after him. He was born in Münster, attended the University of Münster (1903–1909) and then worked as a school teacher and tutor until his retirement in 1949. He married in 1916 and had no children. Wieferich abandoned his studies after his graduation and did not publish any paper after 1909. His mathematical reputation is founded on five papers he published while a student at Münster: *. *. *. *. *. The first three papers are related to Waring's problem. His fourth paper led to the term ''Wieferich prime'', which are p such that p^2 divides 2^(p-1) - 1." See also * Wieferich pair * Wieferich's theorem *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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Preda Mihăilescu
Preda V. Mihăilescu (born 23 May 1955) is a Romanian mathematician, best known for his proof of the 158-year-old Catalan's conjecture. Biography Born in Bucharest,Stewart 2013 he is the brother of Vintilă Mihăilescu. After leaving Romania in 1973, he settled in Switzerland. He studied mathematics and computer science in Zürich, receiving a PhD from ETH Zürich in 1997. His PhD thesis, titled ''Cyclotomy of rings and primality testing'', was written under the direction of Erwin Engeler and Hendrik Lenstra. For several years, he did research at the University of Paderborn, Germany. Since 2005, he has held a professorship at the University of Göttingen. Major research In 2002, Mihăilescu proved Catalan's conjecture.Bilu et al. 2014. This number-theoretical conjecture, formulated by the French and Belgian mathematician Eugène Charles Catalan in 1844, had stood unresolved for 158 years. Mihăilescu's proof appeared in ''Crelle's Journal ''Crelle's Journal'', or just '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mihăilescu's Theorem
Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1844 and proven in 2002 by Preda Mihăilescu at Paderborn University. The integers 23 and 32 are two perfect powers (that is, powers of exponent higher than one) of natural numbers whose values (8 and 9, respectively) are consecutive. The theorem states that this is the ''only'' case of two consecutive perfect powers. That is to say, that History The history of the problem dates back at least to Gersonides, who proved a special case of the conjecture in 1343 where (''x'', ''y'') was restricted to be (2, 3) or (3, 2). The first significant progress after Catalan made his conjecture came in 1850 when Victor-Amédée Lebesgue dealt with the case ''b'' = 2. In 1976, Robert Tijdeman applied Baker's method in transcendence theory to establish a bound on ''a'',''b'' and used existing results bounding ''x'',''y'' in terms of ''a'', ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
On-Line Encyclopedia Of Integer Sequences
The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching at AT&T Labs. He transferred the intellectual property and hosting of the OEIS to the OEIS Foundation in 2009, and is its chairman. OEIS records information on integer sequences of interest to both professional and amateur mathematicians, and is widely cited. , it contains over 370,000 sequences, and is growing by approximately 30 entries per day. Each entry contains the leading terms of the sequence, keywords, mathematical motivations, literature links, and more, including the option to generate a graph or play a musical representation of the sequence. The database is searchable by keyword, by subsequence, or by any of 16 fields. There is also an advanced search function called SuperSeeker which runs a large number of different algorithms to identify sequences related to the input. History Neil Sloane started col ... [...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 stronge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fermat Quotient
In number theory, the Fermat quotient of an integer ''a'' with respect to an odd prime ''p'' is defined as :q_p(a) = \frac, or :\delta_p(a) = \frac. This article is about the former; for the latter see ''p''-derivation. The quotient is named after Pierre de Fermat. If the base ''a'' is coprime to the exponent ''p'' then Fermat's little theorem says that ''q''''p''(''a'') will be an integer. If the base ''a'' is also a generator of the multiplicative group of integers modulo ''p'', then ''q''''p''(''a'') will be a cyclic number, and ''p'' will be a full reptend prime. Properties From the definition, it is obvious that :\begin q_p(1) &\equiv 0 && \pmod \\ q_p(-a)&\equiv q_p(a) && \pmod\quad (\text 2 \mid p-1) \end In 1850, Gotthold Eisenstein proved that if ''a'' and ''b'' are both coprime to ''p'', then: :\begin q_p(ab) &\equiv q_p(a)+q_p(b) &&\pmod \\ q_p(a^r) &\equiv rq_p(a) &&\pmod \\ q_p(p \mp a) &\equiv q_p(a) \pm \tfrac &&\pmod \\ q_p(p \mp 1) &\equiv \pm 1 && \pmo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Astérisque
'' Astérisque'' is a mathematical journal published by Société Mathématique de France Groupe Lactalis S.A. (doing business as Lactalis) is a French multinational dairy products corporation, owned by the Besnier family and based in Laval, Mayenne, France. The company's former name was Besnier S.A. Lactalis is the largest dairy pr ... and founded in 1973. It publishes mathematical monographs, conference reports, and the annual report of the Séminaire Nicolas Bourbaki. External links *Astérisque – AMS Bookstore – American Mathematical Society Société Mathématique de France academic journals Mathematics journals Academic journals established in 1973 English-language journals Irregular journals {{math-journal-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
