|
Gaussian Prime
In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as \mathbf /math> or \Z Gaussian integers share many properties with integers: they form a Euclidean domain, and have thus a Euclidean division and a Euclidean algorithm; this implies unique factorization and many related properties. However, Gaussian integers do not have a total ordering that respects arithmetic. Gaussian integers are algebraic integers and form the simplest ring of quadratic integers. Gaussian integers are named after the German mathematician Carl Friedrich Gauss. Basic definitions The Gaussian integers are the set :\mathbf \, \qquad \text i^2 = -1. In other words, a Gaussian integer is a complex number such that its real and imaginary parts are both integers. Since the Gaussian integers are closed under addition and multip ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gaussian Integral
The Gaussian integral, also known as the Euler–Poisson integral, is the integral of the Gaussian function f(x) = e^ over the entire real line. Named after the German mathematician Carl Friedrich Gauss, the integral is \int_^\infty e^\,dx = \sqrt. Abraham de Moivre originally discovered this type of integral in 1733, while Gauss published the precise integral in 1809. The integral has a wide range of applications. For example, with a slight change of variables it is used to compute the normalizing constant of the normal distribution. The same integral with finite limits is closely related to both the error function and the cumulative distribution function of the normal distribution. In physics this type of integral appears frequently, for example, in quantum mechanics, to find the probability density of the ground state of the harmonic oscillator. This integral is also used in the path integral formulation, to find the propagator of the harmonic oscillator, and in statistical ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Imaginary Part
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a + bi, where and are real numbers. Because no real number satisfies the above equation, was called an imaginary number by René Descartes. For the complex number a+bi, is called the , and is called the . The set of complex numbers is denoted by either of the symbols \mathbb C or . Despite the historical nomenclature "imaginary", complex numbers are regarded in the mathematical sciences as just as "real" as the real numbers and are fundamental in many aspects of the scientific description of the natural world. Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers. More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Greatest Common Divisor
In mathematics, the greatest common divisor (GCD) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers ''x'', ''y'', the greatest common divisor of ''x'' and ''y'' is denoted \gcd (x,y). For example, the GCD of 8 and 12 is 4, that is, \gcd (8, 12) = 4. In the name "greatest common divisor", the adjective "greatest" may be replaced by "highest", and the word "divisor" may be replaced by "factor", so that other names include highest common factor (hcf), etc. Historically, other names for the same concept have included greatest common measure. This notion can be extended to polynomials (see Polynomial greatest common divisor) and other commutative rings (see below). Overview Definition The ''greatest common divisor'' (GCD) of two nonzero integers and is the greatest positive integer such that is a divisor of both and ; that is, there are integers and such that and , and is the larges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate is . An example with three indeterminates is . Polynomials appear in many areas of mathematics and science. For example, they are used to form polynomial equations, which encode a wide range of problems, from elementary word problems to complicated scientific problems; they are used to define polynomial functions, which appear in settings ranging from basic chemistry and physics to economics and social science; they are used in calculus and numerical analysis to approximate other functions. In advanced mathematics, polynomials are used to construct polynomial rings and algebraic varieties, which are central concepts in algebra and algebraic geometry. Etymology The word ''polynomial'' joins tw ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiplicative Inverse
In mathematics, a multiplicative inverse or reciprocal for a number ''x'', denoted by 1/''x'' or ''x''−1, is a number which when multiplied by ''x'' yields the multiplicative identity, 1. The multiplicative inverse of a fraction ''a''/''b'' is ''b''/''a''. For the multiplicative inverse of a real number, divide 1 by the number. For example, the reciprocal of 5 is one fifth (1/5 or 0.2), and the reciprocal of 0.25 is 1 divided by 0.25, or 4. The reciprocal function, the function ''f''(''x'') that maps ''x'' to 1/''x'', is one of the simplest examples of a function which is its own inverse (an involution). Multiplying by a number is the same as dividing by its reciprocal and vice versa. For example, multiplication by 4/5 (or 0.8) will give the same result as division by 5/4 (or 1.25). Therefore, multiplication by a number followed by multiplication by its reciprocal yields the original number (since the product of the number and its reciprocal is 1). The term ''reciproc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unit (ring Theory)
In algebra, a unit of a ring is an invertible element for the multiplication of the ring. That is, an element of a ring is a unit if there exists in such that vu = uv = 1, where is the multiplicative identity; the element is unique for this property and is called the multiplicative inverse of . The set of units of forms a group under multiplication, called the group of units or unit group of . Other notations for the unit group are , , and (from the German term ). Less commonly, the term ''unit'' is sometimes used to refer to the element of the ring, in expressions like ''ring with a unit'' or ''unit ring'', and also unit matrix. Because of this ambiguity, is more commonly called the "unity" or the "identity" of the ring, and the phrases "ring with unity" or a "ring with identity" may be used to emphasize that one is considering a ring instead of a rng. Examples The multiplicative identity and its additive inverse are always units. More generally, any root of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Completely Multiplicative Function
In number theory, functions of positive integers which respect products are important and are called completely multiplicative functions or totally multiplicative functions. A weaker condition is also important, respecting only products of coprime numbers, and such functions are called multiplicative functions. Outside of number theory, the term "multiplicative function" is often taken to be synonymous with "completely multiplicative function" as defined in this article. Definition A completely multiplicative function (or totally multiplicative function) is an arithmetic function (that is, a function whose domain is the natural numbers), such that ''f''(1) = 1 and ''f''(''ab'') = ''f''(''a'')''f''(''b'') holds ''for all'' positive integers ''a'' and ''b''. Without the requirement that ''f''(1) = 1, one could still have ''f''(1) = 0, but then ''f''(''a'') = 0 for all positive integers ''a'', so this is not a very strong restriction. The definition above can be rephrased using t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Number
In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 9 is a square number, since it equals and can be written as . The usual notation for the square of a number is not the product , but the equivalent exponentiation , usually pronounced as " squared". The name ''square'' number comes from the name of the shape. The unit of area is defined as the area of a unit square (). Hence, a square with side length has area . If a square number is represented by ''n'' points, the points can be arranged in rows as a square each side of which has the same number of points as the square root of ''n''; thus, square numbers are a type of figurate numbers (other examples being cube numbers and triangular numbers). Square numbers are non-negative. A non-negative integer is a square number when its square root is again an integer. For example, \sqrt = 3, so 9 is a square ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Absolute Value
In mathematics, the absolute value or modulus of a real number x, is the non-negative value without regard to its sign. Namely, , x, =x if is a positive number, and , x, =-x if x is negative (in which case negating x makes -x positive), and For example, the absolute value of 3 and the absolute value of −3 is The absolute value of a number may be thought of as its distance from zero. Generalisations of the absolute value for real numbers occur in a wide variety of mathematical settings. For example, an absolute value is also defined for the complex numbers, the quaternions, ordered rings, fields and vector spaces. The absolute value is closely related to the notions of magnitude, distance, and norm in various mathematical and physical contexts. Terminology and notation In 1806, Jean-Robert Argand introduced the term ''module'', meaning ''unit of measure'' in French, specifically for the ''complex'' absolute value,Oxford English Dictionary, Draft Revision, June 2 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field Norm
In mathematics, the (field) norm is a particular mapping defined in field theory, which maps elements of a larger field into a subfield. Formal definition Let ''K'' be a field and ''L'' a finite extension (and hence an algebraic extension) of ''K''. The field ''L'' is then a finite dimensional vector space over ''K''. Multiplication by α, an element of ''L'', :m_\alpha\colon L\to L :m_\alpha (x) = \alpha x, is a ''K''-linear transformation of this vector space into itself. The norm, N''L''/''K''(''α''), is defined as the determinant of this linear transformation. If ''L''/''K'' is a Galois extension, one may compute the norm of α ∈ ''L'' as the product of all the Galois conjugates of α: :\operatorname_(\alpha)=\prod_ \sigma(\alpha), where Gal(''L''/''K'') denotes the Galois group of ''L''/''K''. (Note that there may be a repetition in the terms of the product.) For a general field extension ''L''/''K'', and nonzero α in ''L'', let ''σ''(''α''), ..., σ(''α'') ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integer Lattice
In mathematics, the -dimensional integer lattice (or cubic lattice), denoted , is the lattice in the Euclidean space whose lattice points are -tuples of integers. The two-dimensional integer lattice is also called the square lattice, or grid lattice. is the simplest example of a root lattice. The integer lattice is an odd unimodular lattice. Automorphism group The automorphism group (or group of congruences) of the integer lattice consists of all permutations and sign changes of the coordinates, and is of order 2''n'' ''n''!. As a matrix group it is given by the set of all ''n''×''n'' signed permutation matrices. This group is isomorphic to the semidirect product :(\mathbb Z_2)^n \rtimes S_n where the symmetric group ''S''''n'' acts on (Z2)''n'' by permutation (this is a classic example of a wreath product). For the square lattice, this is the group of the square, or the dihedral group of order 8; for the three-dimensional cubic lattice, we get the group of the cub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
