|
É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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Amiens
Amiens (English: or ; ; , or ) is a city and Communes of France, commune in northern France, located north of Paris and south-west of Lille. It is the capital of the Somme (department), Somme Departments of France, department in the region of Hauts-de-France and had a population of 135,429, as of 2021. A central landmark of the city is Amiens Cathedral, the largest Gothic cathedral in France. Amiens also has one of the largest university hospitals in France, with a capacity of 1,200 beds. The author Jules Verne lived in Amiens from 1871 until his death in 1905, and served on the city council for 15 years. Amiens is the birthplace of French president Emmanuel Macron. The town was fought over during both World Wars, suffering significant damage, and was repeatedly occupied by both sides. The 1918 Battle of Amiens (1918), Battle of Amiens was the opening phase of the Hundred Days Offensive which directly led to the Armistice with Germany. The Royal Air Force heavily bombed the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paris Observatory
The Paris Observatory (, ), a research institution of the Paris Sciences et Lettres University, is the foremost astronomical observatory of France, and one of the largest astronomical centres in the world. Its historic building is on the Left Bank of the Seine in central Paris, but most of the staff work on a satellite campus in Meudon, a suburb southwest of Paris. The Paris Observatory was founded in 1667. Construction was completed by the early 1670s and coincided with a major push for increased science, and the founding of the Royal Academy of Sciences. King Louis XIV's minister of finance organized a "scientific powerhouse" to increase understanding of astronomy, maritime navigation, and science in general. Through the centuries the Paris Observatory has continued in support of astronomical activities, and in the 21st century connects multiple sites and organizations, supporting astronomy and science, past and present. Constitution Administratively, it is a '' grand étab ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kempner Function
In number theory, the Kempner function S(n)Called the Kempner numbers in the Online Encyclopedia of Integer Sequences: see is defined for a given positive integer n to be the smallest number s such that n divides the For example, the number 8 does not divide 1!, 2!, but does This function has the property that it has a highly inconsistent growth rate: it grows linearly on the prime numbers but only grows sublogarithmically at the factorial numbers. History This function was first considered by François Édouard Anatole Lucas in 1883, followed by Joseph Jean Baptiste Neuberg in 1887. In 1918, A. J. Kempner gave the first correct algorithm for The Kempner function is also sometimes called the Smarandache function following Florentin Smarandache's rediscovery of the function Properties Since n S(n) is always at A number n greater than 4 is a prime number if and only That is, the numbers n for which S(n) is as large as possible relative to n are the primes. In th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Umbral Calculus
The term umbral calculus has two related but distinct meanings. In mathematics, before the 1970s, umbral calculus referred to the surprising similarity between seemingly unrelated polynomial equations and certain shadowy techniques used to prove them. These techniques were introduced in 1861 by John Blissard and are sometimes called Blissard's symbolic method. They are often attributed to Édouard Lucas (or James Joseph Sylvester), who used the technique extensively. The use of shadowy techniques was put on a solid mathematical footing starting in the 1970s, and the resulting mathematical theory is also referred to as "umbral calculus". History In the 1930s and 1940s, Eric Temple Bell attempted to set the umbral calculus on a rigorous footing, however his attempt in making this kind of argument logically rigorous was unsuccessful. The combinatorialist John Riordan in his book ''Combinatorial Identities'' published in the 1960s, used techniques of this sort extensively. In ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Derrick Henry Lehmer
Derrick Henry "Dick" Lehmer (February 23, 1905 – May 22, 1991), almost always cited as D.H. Lehmer, was an American mathematician significant to the development of computational number theory. Lehmer refined Édouard Lucas' work in the 1930s and devised the Lucas–Lehmer test for Mersenne primes. His peripatetic career as a number theorist, with him and his wife taking numerous types of work in the United States and abroad to support themselves during the Great Depression, fortuitously brought him into the center of research into early electronic computing. Early life Lehmer was born in Berkeley, California, to Derrick Norman Lehmer, a professor of mathematics at the University of California, Berkeley, and Clara Eunice Mitchell. He studied physics and earned a bachelor's degree from UC Berkeley, and continued with graduate studies at the University of Chicago. He and his father worked together on Lehmer sieves. Marriage During his studies at Berkeley, Lehmer met Emma Ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mersenne Prime
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 should 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–Eule ... [...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] |
American Mathematical Monthly
''The American Mathematical Monthly'' is a peer-reviewed scientific journal of mathematics. It was established by Benjamin Finkel in 1894 and is published by Taylor & Francis on behalf of the Mathematical Association of America. It is an expository journal intended for a wide audience of mathematicians, from undergraduate students to research professionals. Articles are chosen on the basis of their broad interest and reviewed and edited for quality of exposition as well as content. The editor-in-chief An editor-in-chief (EIC), also known as lead editor or chief editor, is a publication's editorial leader who has final responsibility for its operations and policies. The editor-in-chief heads all departments of the organization and is held accoun ... is Vadim Ponomarenko ( San Diego State University). The journal gives the Lester R. Ford Award annually to "authors of articles of expository excellence" published in the journal. Editors-in-chief The following persons are or have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elementary Proof
In mathematics, an elementary proof is a mathematical proof that only uses basic techniques. More specifically, the term is used in number theory to refer to proofs that make no use of complex analysis. Historically, it was once thought that certain theorems, like the prime number theorem, could only be proved by invoking "higher" mathematical theorems or techniques. However, as time progresses, many of these results have also been subsequently reproven using only elementary techniques. While there is generally no consensus as to what counts as elementary, the term is nevertheless a common part of the mathematical jargon. An elementary proof is not necessarily simple, in the sense of being easy to understand or trivial. In fact, some elementary proofs can be quite complicated — and this is especially true when a statement of notable importance is involved.. Prime number theorem The distinction between elementary and non-elementary proofs has been considered especially important ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bosonic String Theory
Bosonic string theory is the original version of string theory, developed in the late 1960s. It is so called because it contains only bosons in the spectrum. In the 1980s, supersymmetry was discovered in the context of string theory, and a new version of string theory called superstring theory (supersymmetric string theory) became the real focus. Nevertheless, bosonic string theory remains a very useful model to understand many general features of perturbative string theory, and many theoretical difficulties of superstrings can actually already be found in the context of bosonic strings. Problems Although bosonic string theory has many attractive features, it falls short as a viable physical model in two significant areas. First, it predicts only the existence of bosons whereas many physical particles are fermions. Second, it predicts the existence of a mode of the string with imaginary mass, implying that the theory has an instability to a process known as "tachyon conde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elliptic Function
In the mathematical field of complex analysis, elliptic functions are special kinds of meromorphic functions, that satisfy two periodicity conditions. They are named elliptic functions because they come from elliptic integrals. Those integrals are in turn named elliptic because they first were encountered for the calculation of the arc length of an ellipse. Important elliptic functions are Jacobi elliptic functions and the Weierstrass \wp-function. Further development of this theory led to hyperelliptic functions and modular forms. Definition A meromorphic function is called an elliptic function, if there are two \mathbb- linear independent complex numbers \omega_1,\omega_2\in\mathbb such that : f(z + \omega_1) = f(z) and f(z + \omega_2) = f(z), \quad \forall z\in\mathbb. So elliptic functions have two periods and are therefore doubly periodic functions. Period lattice and fundamental domain If f is an elliptic function with periods \omega_1,\omega_2 it also holds ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Pyramid
In geometry, a square pyramid is a Pyramid (geometry), pyramid with a square base and four triangles, having a total of five faces. If the Apex (geometry), apex of the pyramid is directly above the center of the square, it is a ''right square pyramid'' with four isosceles triangles; otherwise, it is an ''oblique square pyramid''. When all of the pyramid's edges are equal in length, its triangles are all equilateral triangle, equilateral. It is called an ''equilateral square pyramid'', an example of a Johnson solid. Square pyramids have appeared throughout the history of architecture, with examples being Egyptian pyramids and many other similar buildings. They also occur in chemistry in Square pyramidal molecular geometry, square pyramidal molecular structures. Square pyramids are often used in the construction of other polyhedra. Many mathematicians in ancient times discovered the formula for the volume of a square pyramid with different approaches. Special cases Right squar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
