|
Biquadratic Reciprocity
Quartic or biquadratic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence ''x''4 ≡ ''p'' (mod ''q'') is solvable; the word "reciprocity" comes from the form of some of these theorems, in that they relate the solvability of the congruence ''x''4 ≡ ''p'' (mod ''q'') to that of ''x''4 ≡ ''q'' (mod ''p''). History Euler made the first conjectures about biquadratic reciprocity. Gauss published two monographs on biquadratic reciprocity. In the first one (1828) he proved Euler's conjecture about the biquadratic character of 2. In the second one (1832) he stated the biquadratic reciprocity law for the Gaussian integers and proved the supplementary formulas. He saidGauss, BQ, § 67 that a third monograph would be forthcoming with the proof of the general theorem, but it never appeared. Jacobi presented proofs in his Königsberg lectures of 1836–37. The first published proofs were by Eis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Number Theory
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from 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 can often be understood through the study of Complex analysis, analytical objects, such as the Riemann zeta function, that encode properties of the integers, primes or other number-theoretic objects in some fashion (analytic number theory). One may also study real numbers in relation to rational numbers, as for instance how irrational numbers can be approximated by fractions (Diophantine approximation). Number theory is one of the oldest branches of mathematics alongside geometry. One quirk of number theory is ... [...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] |
Algebraic Number Field
In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a field that contains \mathbb and has finite dimension when considered as a vector space over The study of algebraic number fields, that is, of algebraic extensions of the field of rational numbers, is the central topic of algebraic number theory. This study reveals hidden structures behind the rational numbers, by using algebraic methods. Definition Prerequisites The notion of algebraic number field relies on the concept of a field. A field consists of a set of elements together with two operations, namely addition, and multiplication, and some distributivity assumptions. These operations make the field into an abelian group under addition, and they make the nonzero elements of the field into another abelian group under multiplicat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integers
An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative integers. The set (mathematics), set of all integers is often denoted by the boldface or blackboard bold The set of natural numbers \mathbb is a subset of \mathbb, which in turn is a subset of the set of all rational numbers \mathbb, itself a subset of the real numbers \mathbb. Like the set of natural numbers, the set of integers \mathbb is Countable set, countably infinite. An integer may be regarded as a real number that can be written without a fraction, fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , 5/4, and Square root of 2, are not. The integers form the smallest Group (mathematics), group and the smallest ring (mathematics), ring containing the natural numbers. In algebraic number theory, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artin Reciprocity
The Artin reciprocity law, which was established by Emil Artin in a series of papers (1924; 1927; 1930), is a general theorem in number theory that forms a central part of global class field theory. The term " reciprocity law" refers to a long line of more concrete number theoretic statements which it generalized, from the quadratic reciprocity law and the reciprocity laws of Eisenstein and Kummer to Hilbert's product formula for the norm symbol. Artin's result provided a partial solution to Hilbert's ninth problem. Statement Let L/K be a Galois extension of global fields and C_L stand for the idèle class group of L. One of the statements of the Artin reciprocity law is that there is a canonical isomorphism called the global symbol mapNeukirch (1999) p.391 : \theta: C_K/ \to \operatorname(L/K)^, where \text denotes the abelianization of a group, and \operatorname(L/K) is the Galois group of L over K. The map \theta is defined by assembling the maps called the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eisenstein Reciprocity
In algebraic number theory Eisenstein's reciprocity law is a reciprocity law that extends the law of quadratic reciprocity and the cubic reciprocity law to residues of higher powers. It is one of the earliest and simplest of the higher reciprocity laws, and is a consequence of several later and stronger reciprocity laws such as the Artin reciprocity law. It was introduced by , though Jacobi had previously announced (without proof) a similar result for the special cases of 5th, 8th and 12th powers in 1839. Background and notation Let m > 1 be an integer, and let \mathcal_m be the ring of integers of the ''m''-th cyclotomic field \mathbb(\zeta_m), where \zeta_m=e^ is a primitive ''m''-th root of unity. The numbers \zeta_m, \zeta_m^2,\dots\zeta_m^m=1 are units in \mathcal_m. (There are other units as well.) Primary numbers A number \alpha\in\mathcal_m is called primary if it is not a unit, is relatively prime to m, and is congruent to a rational (i.e. in \mathbb) integer (\!\bmo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Octic Reciprocity
In number theory, octic reciprocity is a reciprocity law relating the residues of 8th powers modulo primes, analogous to the law of quadratic reciprocity, cubic reciprocity, and quartic reciprocity. There is a rational reciprocity law for 8th powers, due to Williams. Define the symbol \left(\frac xp\right)_k to be +1 if ''x'' is a ''k''-th power modulo the prime ''p'' and -1 otherwise. Let ''p'' and ''q'' be distinct primes congruent to 1 modulo 8, such that \left(\frac pq\right)_4 = \left(\frac qp\right)_4 = +1 . Let ''p'' = ''a''2 + ''b''2 = ''c''2 + 2''d''2 and ''q'' = ''A''2 + ''B''2 = ''C''2 + 2''D''2, with ''aA'' odd. Then : \left(\frac pq\right)_8 \left(\frac qp\right)_8 = \left(\fracq\right)_4 \left(\fracq\right)_2 \ . See also * Artin reciprocity * Eisenstein reciprocity In algebraic number theory Eisenstein's reciprocity law is a reciprocity law that extends the law of quadratic reciprocity and the cubic reciprocity law to residues of higher powers. It is one ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cubic Reciprocity
Cubic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence ''x''3 ≡ ''p'' (mod ''q'') is solvable; the word "reciprocity" comes from the form of the main theorem, which states that if ''p'' and ''q'' are primary numbers in the ring of Eisenstein integers, both coprime to 3, the congruence ''x''3 ≡ ''p'' (mod ''q'') is solvable if and only if ''x''3 ≡ ''q'' (mod ''p'') is solvable. History Sometime before 1748 Euler made the first conjectures about the cubic residuacity of small integers, but they were not published until 1849, 62 years after his death. Gauss's published works mention cubic residues and reciprocity three times: there is one result pertaining to cubic residues in the Disquisitiones Arithmeticae (1801). In the introduction to the fifth and sixth proofs of quadratic reciprocity (1818) he said that he was publishing these proofs because their techniques ( Gauss ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadratic Reciprocity
In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is: This law, together with its supplements, allows the easy calculation of any Legendre symbol, making it possible to determine whether there is an integer solution for any quadratic equation of the form x^2\equiv a \bmod p for an odd prime p; that is, to determine the "perfect squares" modulo p. However, this is a non-constructive result: it gives no help at all for finding a ''specific'' solution; for this, other methods are required. For example, in the case p\equiv 3 \bmod 4 using Euler's criterion one can give an explicit formula for the "square roots" modulo p of a quadratic residue a, namely, :\pm a^ indeed, :\left (\pm a^ \right )^2=a^=a\cdot a^\equiv a\left(\frac\right)=a \bmod p. This formula only works if it is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jacobi Symbol
Jacobi symbol for various ''k'' (along top) and ''n'' (along left side). Only are shown, since due to rule (2) below any other ''k'' can be reduced modulo ''n''. Quadratic residues are highlighted in yellow — note that no entry with a Jacobi symbol of −1 is a quadratic residue, and if ''k'' is a quadratic residue modulo a coprime ''n'', then , but not all entries with a Jacobi symbol of 1 (see the and rows) are quadratic residues. Notice also that when either ''n'' or ''k'' is a square, all values are nonnegative. The Jacobi symbol is a generalization of the Legendre symbol. Introduced by Carl Gustav Jakob Jacobi, Jacobi in 1837, it is of theoretical interest in modular arithmetic and other branches of number theory, but its main use is in computational number theory, especially primality testing and integer factorization; these in turn are important in cryptography. Definition For any integer ''a'' and any positive odd integer ''n'', the Jacobi symbol is define ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Conjugation
In mathematics, the complex conjugate of a complex number is the number with an equal real part and an imaginary part equal in magnitude but opposite in sign. That is, if a and b are real numbers, then the complex conjugate of a + bi is a - bi. The complex conjugate of z is often denoted as \overline or z^*. In polar form, if r and \varphi are real numbers then the conjugate of r e^ is r e^. This can be shown using Euler's formula. The product of a complex number and its conjugate is a real number: a^2 + b^2 (or r^2 in polar coordinates). If a root of a univariate polynomial with real coefficients is complex, then its complex conjugate is also a root. Notation The complex conjugate of a complex number z is written as \overline z or z^*. The first notation, a vinculum, avoids confusion with the notation for the conjugate transpose of a matrix, which can be thought of as a generalization of the complex conjugate. The second is preferred in physics, where ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fermat's Little Theorem
In number theory, Fermat's little theorem states that if is a prime number, then for any integer , the number is an integer multiple of . In the notation of modular arithmetic, this is expressed as a^p \equiv a \pmod p. For example, if and , then , and is an integer multiple of . If is not divisible by , that is, if is coprime to , then Fermat's little theorem is equivalent to the statement that is an integer multiple of , or in symbols: a^ \equiv 1 \pmod p. For example, if and , then , and is a multiple of . Fermat's little theorem is the basis for the Fermat primality test and is one of the fundamental results of elementary number theory. The theorem is named after Pierre de Fermat, who stated it in 1640. It is called the "little theorem" to distinguish it from Fermat's Last Theorem.. History Pierre de Fermat first stated the theorem in a letter dated October 18, 1640, to his friend and confidant Frénicle de Bessy. His formulation is equivalent to the following ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
