Quadratic Gauss Sum
   HOME





Quadratic Gauss Sum
In number theory, quadratic Gauss sums are certain finite sums of roots of unity. A quadratic Gauss sum can be interpreted as a linear combination of the values of the complex exponential function with coefficients given by a quadratic character; for a general character, one obtains a more general Gauss sum. These objects are named after Carl Friedrich Gauss, who studied them extensively and applied them to quadratic, cubic, and biquadratic reciprocity laws. Definition For an odd prime number and an integer , the quadratic Gauss sum is defined as : g(a;p) = \sum_^\zeta_p^, where \zeta_p is a primitive th root of unity, for example \zeta_p=\exp(2\pi i/p). Equivalently, : g(a;p) = \sum_^\big(1+\left(\tfrac\right)\big)\,\zeta_p^. For divisible by , and we have \zeta_p^=1 and thus : g(a;p) = p. For not divisible by , we have \sum_^ \zeta_p^ = 0, implying that : g(a;p) = \sum_^\left(\tfrac\right)\,\zeta_p^ = G(a,\left(\tfrac\right)), where : G(a,\chi)=\sum_^\chi(n)\,\zeta_ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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]  


picture info

Issai Schur
Issai Schur (10 January 1875 – 10 January 1941) was a Russian mathematician who worked in Germany for most of his life. He studied at the Humboldt University of Berlin, University of Berlin. He obtained his doctorate in 1901, became lecturer in 1903 and, after a stay at the University of Bonn, professor in 1919. As a student of Ferdinand Georg Frobenius, he worked on group representations (the subject with which he is most closely associated), but also in combinatorics and Quadratic residue#The Pólya–Vinogradov inequality, number theory and even theoretical physics. He is perhaps best known today for his result on the existence of the Schur decomposition and for his work on group representations (Schur's lemma). Schur published under the name of both I. Schur, and J. Schur, the latter especially in ''Journal für die reine und angewandte Mathematik''. This has led to some confusion. Childhood Issai Schur was born into a Jewish family, the son of the businessman Moses Schur ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Kummer Sum
In mathematics, Kummer sum is the name given to certain cubic Gauss sums for a prime modulus ''p'', with ''p'' congruent to 1 modulo 3. They are named after Ernst Kummer, who made a conjecture about the statistical properties of their arguments, as complex numbers. These sums were known and used before Kummer, in the theory of cyclotomy. Definition A Kummer sum is therefore a finite sum :\sum \chi(r)e(r/p) = G(\chi) taken over ''r'' modulo ''p'', where χ is a Dirichlet character In analytic number theory and related branches of mathematics, a complex-valued arithmetic function \chi: \mathbb\rightarrow\mathbb is a Dirichlet character of modulus m (where m is a positive integer) if for all integers a and b: # \chi(ab) = \ch ... taking values in the cube roots of unity, and where ''e''(''x'') is the exponential function exp(2π''ix''). Given ''p'' of the required form, there are two such characters, together with the trivial character. The cubic exponential sum ''K''(''n'',''p'' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Gaussian Period
In mathematics, in the area of number theory, a Gaussian period is a certain kind of sum of root of unity, roots of unity. The periods permit explicit calculations in cyclotomic fields connected with Galois theory and with harmonic analysis (discrete Fourier transform). They are basic in the classical theory called cyclotomy. Closely related is the Gauss sum, a type of exponential sum which is a linear combination of periods. History As the name suggests, the periods were introduced by Carl Friedrich Gauss, Gauss and were the basis for his theory of compass and straightedge construction. For example, the construction of the heptadecagon (a formula that furthered his reputation) depended on the algebra of such periods, of which : 2 \cos \left(\frac\right) = \zeta + \zeta^ \, is an example involving the seventeenth root of unity : \zeta = \exp \left(\frac\right). General definition Given an integer ''n'' > 1, let ''H'' be any subgroup of the multiplicative group : G = (\mathb ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Square-free Integer
In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1. That is, its prime factorization has exactly one factor for each prime that appears in it. For example, is square-free, but is not, because 18 is divisible by . The smallest positive square-free numbers are Square-free factorization Every positive integer n can be factored in a unique way as n=\prod_^k q_i^i, where the q_i different from one are square-free integers that are pairwise coprime. This is called the ''square-free factorization'' of . To construct the square-free factorization, let n=\prod_^h p_j^ be the prime factorization of n, where the p_j are distinct prime numbers. Then the factors of the square-free factorization are defined as q_i=\prod_p_j. An integer is square-free if and only if q_i=1 for all i > 1. An integer greater than one is the kth power of another integer if and only if k is a divisor of all i such that q_i\neq 1. Th ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Geometric Sum
In mathematics, a geometric series is a series summing the terms of an infinite geometric sequence, in which the ratio of consecutive terms is constant. For example, the series \tfrac12 + \tfrac14 + \tfrac18 + \cdots is a geometric series with common ratio , which converges to the sum of . Each term in a geometric series is the geometric mean of the term before it and the term after it, in the same way that each term of an arithmetic series is the arithmetic mean of its neighbors. While Greek philosopher Zeno's paradoxes about time and motion (5th century BCE) have been interpreted as involving geometric series, such series were formally studied and applied a century or two later by Greek mathematicians, for example used by Archimedes to calculate the area inside a parabola (3rd century BCE). Today, geometric series are used in mathematical finance, calculating areas of fractals, and various computer science topics. Though geometric series most commonly involve real or compl ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Completing The Square
In elementary algebra, completing the square is a technique for converting a quadratic polynomial of the form to the form for some values of and . In terms of a new quantity , this expression is a quadratic polynomial with no linear term. By subsequently isolating and taking the square root, a quadratic problem can be reduced to a linear problem. The name ''completing the square'' comes from a geometrical picture in which represents an unknown length. Then the quantity represents the area of a square of side and the quantity represents the area of a pair of Congruence (geometry), congruent rectangles with sides and . To this square and pair of rectangles one more square is added, of side length . This crucial step ''completes'' a larger square of side length . Completing the square is the oldest method of solving general quadratic equations, used in Old Babylonian Empire, Old Babylonian clay tablets dating from 1800–1600 BCE, and is still taught in elementary algebra c ...
[...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]  


picture info

Chinese Remainder Theorem
In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer ''n'' by several integers, then one can determine uniquely the remainder of the division of ''n'' by the product of these integers, under the condition that the divisors are pairwise coprime (no two divisors share a common factor other than 1). The theorem is sometimes called Sunzi's theorem. Both names of the theorem refer to its earliest known statement that appeared in '' Sunzi Suanjing'', a Chinese manuscript written during the 3rd to 5th century CE. This first statement was restricted to the following example: If one knows that the remainder of ''n'' divided by 3 is 2, the remainder of ''n'' divided by 5 is 3, and the remainder of ''n'' divided by 7 is 2, then with no other information, one can determine the remainder of ''n'' divided by 105 (the product of 3, 5, and 7) without knowing the value of ''n''. In this example, the remainder is 23. More ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Greatest Common Divisor
In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers , , the greatest common divisor of and is denoted \gcd (x,y). For example, the GCD of 8 and 12 is 4, that is, . 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, 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 integers and , at least one of which is nonzero, is the greatest positive integer such that is a divisor of both and ; that is, there are integers and such that ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Multiplicative Function
In number theory, a multiplicative function is an arithmetic function f of a positive integer n with the property that f(1)=1 and f(ab) = f(a)f(b) whenever a and b are coprime. An arithmetic function is said to be completely multiplicative (or totally multiplicative) if f(1)=1 and f(ab) = f(a)f(b) holds ''for all'' positive integers a and b, even when they are not coprime. Examples Some multiplicative functions are defined to make formulas easier to write: * 1(n): the constant function defined by 1(n)=1 * \operatorname(n): the identity function, defined by \operatorname(n)=n * \operatorname_k(n): the power functions, defined by \operatorname_k(n)=n^k for any complex number k. As special cases we have ** \operatorname_0(n)=1(n), and ** \operatorname_1(n)=\operatorname(n). * \varepsilon(n): the function defined by \varepsilon(n)=1 if n=1 and 0 otherwise; this is the unit function, so called because it is the multiplicative identity for Dirichlet convolution. Sometimes ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Residue Class
In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book '' Disquisitiones Arithmeticae'', published in 1801. A familiar example of modular arithmetic is the hour hand on a 12-hour clock. If the hour hand points to 7 now, then 8 hours later it will point to 3. Ordinary addition would result in , but 15 reads as 3 on the clock face. This is because the hour hand makes one rotation every 12 hours and the hour number starts over when the hour hand passes 12. We say that 15 is ''congruent'' to 3 modulo 12, written 15 ≡ 3 (mod 12), so that 7 + 8 ≡ 3 (mod 12). Similarly, if one starts at 12 and waits 8 hours, the hour hand will be at 8. If one instead waited twice as long, 16 hours, the hour hand would be on 4. This can b ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]