|
Quadratic Integer
In number theory, quadratic integers are a generalization of the usual integers to quadratic fields. Quadratic integers are algebraic integers of degree two, that is, solutions of equations of the form : with and (usual) integers. When algebraic integers are considered, the usual integers are often called ''rational integers''. Common examples of quadratic integers are the square roots of rational integers, such as , and the complex number , which generates the Gaussian integers. Another common example is the non-real cubic root of unity , which generates the Eisenstein integers. Quadratic integers occur in the solutions of many Diophantine equations, such as Pell's equations, and other questions related to integral quadratic forms. The study of rings of quadratic integers is basic for many questions of algebraic number theory. History Medieval Indian mathematicians had already discovered a multiplication of quadratic integers of the same , which allowed them to solve so ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Number Theory
Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics."German original: "Die Mathematik ist die Königin der Wissenschaften, und die Arithmetik ist die Königin der Mathematik." Number theorists study prime numbers as well as the properties of mathematical objects made out of integers (for example, rational numbers) or defined as generalizations of the integers (for example, algebraic integers). Integers can be considered either in themselves or as solutions to equations ( Diophantine geometry). Questions in number theory are often best understood through the study of analytical objects (for example, the Riemann zeta function) that encode properties of the integers, primes or other number-theoretic object ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Integral Domain
In mathematics, specifically abstract algebra, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibility. In an integral domain, every nonzero element ''a'' has the cancellation property, that is, if , an equality implies . "Integral domain" is defined almost universally as above, but there is some variation. This article follows the convention that rings have a multiplicative identity, generally denoted 1, but some authors do not follow this, by not requiring integral domains to have a multiplicative identity. Noncommutative integral domains are sometimes admitted. This article, however, follows the much more usual convention of reserving the term "integral domain" for the commutative case and using " domain" for the general case including noncommutative rings. Some sources, notably Lang, use the term ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Square Root
In mathematics, a square root of a number is a number such that ; in other words, a number whose ''square'' (the result of multiplying the number by itself, or ⋅ ) is . For example, 4 and −4 are square roots of 16, because . Every nonnegative real number has a unique nonnegative square root, called the ''principal square root'', which is denoted by \sqrt, where the symbol \sqrt is called the '' radical sign'' or ''radix''. For example, to express the fact that the principal square root of 9 is 3, we write \sqrt = 3. The term (or number) whose square root is being considered is known as the ''radicand''. The radicand is the number or expression underneath the radical sign, in this case 9. For nonnegative , the principal square root can also be written in exponent notation, as . Every positive number has two square roots: \sqrt, which is positive, and -\sqrt, which is negative. The two roots can be written more concisely using the ± sign as \plusmn\sq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Discriminant
In mathematics, the discriminant of a polynomial is a quantity that depends on the coefficients and allows deducing some properties of the roots without computing them. More precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number theory, and algebraic geometry. The discriminant of the quadratic polynomial ax^2+bx+c is :b^2-4ac, the quantity which appears under the square root in the quadratic formula. If a\ne 0, this discriminant is zero if and only if the polynomial has a double root. In the case of real coefficients, it is positive if the polynomial has two distinct real roots, and negative if it has two distinct complex conjugate roots. Similarly, the discriminant of a cubic polynomial is zero if and only if the polynomial has a multiple root. In the case of a cubic with real coefficients, the discriminant is positive if the polynomial has three distinct real roots, and negati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Integral Closure
In commutative algebra, an element ''b'' of a commutative ring ''B'' is said to be integral over ''A'', a subring of ''B'', if there are ''n'' ≥ 1 and ''a''''j'' in ''A'' such that :b^n + a_ b^ + \cdots + a_1 b + a_0 = 0. That is to say, ''b'' is a root of a monic polynomial over ''A''. The set of elements of ''B'' that are integral over ''A'' is called the integral closure of ''A'' in ''B''. It is a subring of ''B'' containing ''A''. If every element of ''B'' is integral over ''A'', then we say that ''B'' is integral over ''A'', or equivalently ''B'' is an integral extension of ''A''. If ''A'', ''B'' are fields, then the notions of "integral over" and of an "integral extension" are precisely " algebraic over" and " algebraic extensions" in field theory (since the root of any polynomial is the root of a monic polynomial). The case of greatest interest in number theory is that of complex numbers integral over Z (e.g., \sqrt or 1+i); in this context, the integral elements ar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Ring Of Integers
In mathematics, the ring of integers of an algebraic number field K is the ring of all algebraic integers contained in K. An algebraic integer is a root of a monic polynomial with integer coefficients: x^n+c_x^+\cdots+c_0. This ring is often denoted by O_K or \mathcal O_K. Since any integer belongs to K and is an integral element of K, the ring \mathbb is always a subring of O_K. The ring of integers \mathbb is the simplest possible ring of integers. Namely, \mathbb=O_ where \mathbb is the field of rational numbers. And indeed, in algebraic number theory the elements of \mathbb are often called the "rational integers" because of this. The next simplest example is the ring of Gaussian integers \mathbb /math>, consisting of complex numbers whose real and imaginary parts are integers. It is the ring of integers in the number field \mathbb(i) of Gaussian rationals, consisting of complex numbers whose real and imaginary parts are rational numbers. Like the rational integers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Automorphism
In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms of an object forms a group, called the automorphism group. It is, loosely speaking, the symmetry group of the object. Definition In the context of abstract algebra, a mathematical object is an algebraic structure such as a group, ring, or vector space. An automorphism is simply a bijective homomorphism of an object with itself. (The definition of a homomorphism depends on the type of algebraic structure; see, for example, group homomorphism, ring homomorphism, and linear operator.) The identity morphism ( identity mapping) is called the trivial automorphism in some contexts. Respectively, other (non-identity) automorphisms are called nontrivial automorphisms. The exact definition of an automorphism depends on the type 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 the ... [...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, Ju ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Half-integer
In mathematics, a half-integer is a number of the form :n + \tfrac, where n is an whole number. For example, :, , , 8.5 are all ''half-integers''. The name "half-integer" is perhaps misleading, as the set may be misunderstood to include numbers such as 1 (being half the integer 2). A name such as "integer-plus-half" may be more accurate, but even though not literally true, "half integer" is the conventional term. Half-integers occur frequently enough in mathematics and in quantum mechanics that a distinct term is convenient. Note that halving an integer does not always produce a half-integer; this is only true for odd integers. For this reason, half-integers are also sometimes called half-odd-integers. Half-integers are a subset of the dyadic rationals (numbers produced by dividing an integer by a power of two). Notation and algebraic structure The set of all half-integers is often denoted :\mathbb Z + \tfrac \quad = \quad \left( \tfrac \mathbb Z \right) \smallsetminus \ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Odd Integer
In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is a multiple of two, and odd if it is not.. For example, −4, 0, 82 are even because \begin -2 \cdot 2 &= -4 \\ 0 \cdot 2 &= 0 \\ 41 \cdot 2 &= 82 \end By contrast, −3, 5, 7, 21 are odd numbers. The above definition of parity applies only to integer numbers, hence it cannot be applied to numbers like 1/2 or 4.201. See the section "Higher mathematics" below for some extensions of the notion of parity to a larger class of "numbers" or in other more general settings. Even and odd numbers have opposite parities, e.g., 22 (even number) and 13 (odd number) have opposite parities. In particular, the parity of zero is even. Any two consecutive integers have opposite parity. A number (i.e., integer) expressed in the decimal numeral system is even or odd according to whether its last digit is even or odd. That is, if the last digit is 1, 3, 5, 7, or 9, then it is odd; other ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Minimal Polynomial (field Theory)
In field theory, a branch of mathematics, the minimal polynomial of an element of a field is, roughly speaking, the polynomial of lowest degree having coefficients in the field, such that is a root of the polynomial. If the minimal polynomial of exists, it is unique. The coefficient of the highest-degree term in the polynomial is required to be 1, and the type for the remaining coefficients could be integers, rational numbers, real numbers, or others. More formally, a minimal polynomial is defined relative to a field extension and an element of the extension field . The minimal polynomial of an element, if it exists, is a member of , the ring of polynomials in the variable with coefficients in . Given an element of , let be the set of all polynomials in such that . The element is called a root or zero of each polynomial in . The set is so named because it is an ideal of . The zero polynomial, all of whose coefficients are 0, is in every since for all and . Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |