|
Sophie Germain's Identity
In mathematics, Sophie Germain's identity is a polynomial factorization named after Sophie Germain stating that \begin x^4 + 4y^4 &= \bigl((x + y)^2 + y^2\bigr)\cdot\bigl((x - y)^2 + y^2\bigr)\\ &= (x^2 + 2xy + 2y^2)\cdot(x^2 - 2xy + 2y^2). \end Beyond its use in elementary algebra, it can also be used in number theory to factorize integers of the special form x^4+4y^4, and it frequently forms the basis of problems in mathematics competitions. History Although the identity has been attributed to Sophie Germain, it does not appear in her works. Instead, in her works one can find the related identity \begin x^4+y^4 &= (x^2-y^2)^2+2(xy)^2\\ &= (x^2+y^2)^2-2(xy)^2.\\ \end Modifying this equation by multiplying y by \sqrt2 gives x^4+4y^4 = (x^2+2y^2)^2-4(xy)^2, a difference of two squares, from which Germain's identity follows. The inaccurate attribution of this identity to Germain was made by Leonard Eugene Dickson in his ''History of the Theory of Numbers'', ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial Factorization
In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain. Polynomial factorization is one of the fundamental components of computer algebra systems. The first polynomial factorization algorithm was published by Theodor von Schubert in 1793. Leopold Kronecker rediscovered Schubert's algorithm in 1882 and extended it to multivariate polynomials and coefficients in an algebraic extension. But most of the knowledge on this topic is not older than circa 1965 and the first computer algebra systems: When the long-known finite step algorithms were first put on computers, they turned out to be highly inefficient. The fact that almost any uni- or multivariate polynomial of degree up to 100 and with coefficients of a moderate size (up to 100 bits) can be factored by modern algorithms in a few minutes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pythagorean Theorem
In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle. It states that the area of the square whose side is the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares on the other two sides. The theorem can be written as an equation relating the lengths of the sides , and the hypotenuse , sometimes called the Pythagorean equation: :a^2 + b^2 = c^2 . The theorem is named for the Ancient Greece, Greek philosopher Pythagoras, born around 570 BC. The theorem has been Mathematical proof, proved numerous times by many different methods – possibly the most for any mathematical theorem. The proofs are diverse, including both Geometry, geometric proofs and Algebra, algebraic proofs, with some dating back thousands of years. When Euclidean space is represented by a Cartesian coordinate system in analytic geometry, Euclidean distance satisfies th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cut-the-Knot
Alexander Bogomolny (January 4, 1948 July 7, 2018) was a Soviet Union, Soviet-born Israeli Americans, Israeli-American mathematician. He was Professor Emeritus of Mathematics at the University of Iowa, and formerly research fellow at the Moscow Institute of Electronics and Mathematics, senior instructor at Hebrew University and software consultant at Ben Gurion University. He wrote extensively about arithmetic, probability, algebra, geometry, trigonometry and mathematical games. He was known for his contribution to heuristics and mathematics education, creating and maintaining the mathematically themed educational website ''Cut-the-Knot'' for the Mathematical Association of America (MAA) Online. He was a pioneer in mathematical education on the internet, having started ''Cut-the-Knot'' in October 1996. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Function
In mathematics, a square is the result of multiplying a number by itself. The verb "to square" is used to denote this operation. Squaring is the same as raising to the power 2, and is denoted by a superscript 2; for instance, the square of 3 may be written as 32, which is the number 9. In some cases when superscripts are not available, as for instance in programming languages or plain text files, the notations ''x''^2 ( caret) or ''x''**2 may be used in place of ''x''2. The adjective which corresponds to squaring is '' quadratic''. The square of an integer may also be called a '' square number'' or a ''perfect square''. In algebra, the operation of squaring is often generalized to polynomials, other expressions, or values in systems of mathematical values other than the numbers. For instance, the square of the linear polynomial is the quadratic polynomial . One of the important properties of squaring, for numbers as well as in many other mathematical systems, is tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functional Equation
In mathematics, a functional equation is, in the broadest meaning, an equation in which one or several functions appear as unknowns. So, differential equations and integral equations are functional equations. However, a more restricted meaning is often used, where a ''functional equation'' is an equation that relates several values of the same function. For example, the logarithm functions are essentially characterized by the ''logarithmic functional equation'' \log(xy)=\log(x) + \log(y). If the domain of the unknown function is supposed to be the natural numbers, the function is generally viewed as a sequence, and, in this case, a functional equation (in the narrower meaning) is called a recurrence relation. Thus the term ''functional equation'' is used mainly for real functions and complex functions. Moreover a smoothness condition is often assumed for the solutions, since without such a condition, most functional equations have very irregular solutions. For example, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aurifeuillean Factorization
In number theory, an aurifeuillean factorization, named after Léon-François-Antoine Aurifeuille, is factorization of certain integer values of the cyclotomic polynomials. Because cyclotomic polynomials are irreducible polynomials over the integers, such a factorization cannot come from an algebraic factorization of the polynomial. Nevertheless, certain families of integers coming from cyclotomic polynomials have factorizations given by formulas applying to the whole family, as in the examples below. Examples * Numbers of the form a^4 + 4b^4 have the following factorization ( Sophie Germain's identity): a^4 + 4b^4 = (a^2 - 2ab + 2b^2)\cdot (a^2 + 2ab + 2b^2). Setting a=1 and b=2^k, one obtains the following aurifeuillean factorization of \Phi_4(2^)=2^+1, where \Phi_4(x)=x^2+1 is the fourth cyclotomic polynomial: 2^+1 = (2^-2^+1)\cdot (2^+2^+1). * Numbers of the form a^6 + 27b^6 have the following factorization, where the first factor (a^2 + 3b^2) is the algebraic factorization o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irreducible Polynomial
In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the ring to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients. It is irreducible if it is considered as a polynomial with integer coefficients, but it factors as \left(x - \sqrt\right)\left(x + \sqrt\right) if it is considered as a polynomial with real coefficients. One says that the polynomial is irreducible over the integers but not over the reals. Polynomial irreducibility can be considered for polynomials with coefficients in an integral domain, and there are two common definitions. Most often, a pol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclotomic Polynomial
In mathematics, the ''n''th cyclotomic polynomial, for any positive integer ''n'', is the unique irreducible polynomial with integer coefficients that is a divisor of x^n-1 and is not a divisor of x^k-1 for any Its roots are all ''n''th primitive roots of unity e^ , where ''k'' runs over the positive integers less than ''n'' and coprime to ''n'' (and ''i'' is the imaginary unit). In other words, the ''n''th cyclotomic polynomial is equal to : \Phi_n(x) = \prod_\stackrel \left(x-e^\right). It may also be defined as the monic polynomial with integer coefficients that is the minimal polynomial over the field of the rational numbers of any primitive ''n''th-root of unity ( e^ is an example of such a root). An important relation linking cyclotomic polynomials and primitive roots of unity is :\prod_\Phi_d(x) = x^n - 1, showing that x is a root of x^n - 1 if and only if it is a ''d''th primitive root of unity for some ''d'' that divides ''n''. Examples If ''n'' is a prim ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integer Sequence
In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified ''explicitly'' by giving a formula for its ''n''th term, or ''implicitly'' by giving a relationship between its terms. For example, the sequence 0, 1, 1, 2, 3, 5, 8, 13, ... (the Fibonacci number, Fibonacci sequence) is formed by starting with 0 and 1 and then adding any two consecutive terms to obtain the next one: an implicit description . The sequence 0, 3, 8, 15, ... is formed according to the formula ''n''2 − 1 for the ''n''th term: an explicit definition. Alternatively, an integer sequence may be defined by a property which members of the sequence possess and other integers do not possess. For example, we can determine whether a given integer is a perfect number, , even though we do not have a formula for the ''n''th perfect number. Computable and definable sequences An integer sequence is computable function, computable if th ... [...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] |
Proof Without Words
In mathematics, a proof without words (or visual proof) is an illustration of an identity (mathematics), identity or mathematical statement which can be demonstrated as self-evident by a diagram without any accompanying explanatory text. Such proofs can be considered more Mathematical beauty, elegant than formal or rigour, mathematically rigorous proofs due to their self-evident nature. When the diagram demonstrates a particular case of a general statement, to be a proof, it must be generalisable. A proof without words is not the same as a mathematical proof, because it omits the details of the logical argument it illustrates. However, it can provide valuable intuitions to the viewer that can help them formulate or better understand a true proof. Examples Sum of odd numbers The statement that the sum of all positive parity (mathematics), odd numbers up to 2''n'' − 1 is a square number, perfect square—more specifically, the perfect square ''n''2—can be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sophie Germain
Marie-Sophie Germain (; 1 April 1776 – 27 June 1831) was a French mathematician, physicist, and philosopher. Despite initial opposition from her parents and difficulties presented by society, she gained education from books in her father's library, including ones by Euler, and from correspondence with famous mathematicians such as Lagrange, Legendre, and Gauss (under the pseudonym of Monsieur Le Blanc). One of the pioneers of elasticity theory, she won the grand prize from the Paris Academy of Sciences for her essay on the subject. Her work on Fermat's Last Theorem provided a foundation for mathematicians exploring the subject for hundreds of years after. Because of prejudice against her sex, she was unable to make a career out of mathematics, but she worked independently throughout her life. Before her death, Gauss had recommended that she be awarded an honorary degree, but that never occurred. On 27 June 1831, she died from breast cancer. At the centenary of her life, a stree ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
