- quadratic nonresidue
- мат. квадратичный невычет
Большой англо-русский и русско-английский словарь. 2001.
quadratic nonresidue
Смотреть что такое "quadratic nonresidue" в других словарях:
Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… … Wikipedia
Quadratic reciprocity — The law of quadratic reciprocity is a theorem from modular arithmetic, a branch of number theory, which shows a remarkable relationship between the solvability of certain quadratic equations modulo different prime moduli.Although it allows us to… … Wikipedia
Legendre symbol — The Legendre symbol or quadratic character is a function introduced by Adrien Marie Legendre in 1798 [A. M. Legendre Essai sur la theorie des nombres Paris 1798, p 186] during his partly successful attempt to prove the law of quadratic… … Wikipedia
Jacobi symbol — The Jacobi symbol is a generalization of the Legendre symbol introduced by Jacobi in 1837 [C.G.J.Jacobi Uber die Kreisteilung und ihre Anwendung auf die Zahlentheorie , Bericht Ak. Wiss. Berlin (1837) pp 127 136] . It is of theoretical interest… … Wikipedia
Smith–Minkowski–Siegel mass formula — In mathematics, the Smith–Minkowski–Siegel mass formula (or Minkowski–Siegel mass formula) is a formula for the sum of the weights of the lattices (quadratic forms) in a genus, weighted by the reciprocals of the orders of their automorphism… … Wikipedia
Fermat number — In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 … Wikipedia
Dirichlet's theorem on arithmetic progressions — In number theory, Dirichlet s theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n ≥ 0. In other… … Wikipedia
Zero-knowledge proof — In cryptography, a zero knowledge proof or zero knowledge protocol is an interactive method for one party to prove to another that a (usually mathematical) statement is true, without revealing anything other than the veracity of the statement.A… … Wikipedia
Character sum — In mathematics, a character sum is a sum of values of a Dirichlet character χ modulo N, taken over a given range of values of n. Such sums are basic in a number of questions, for example in the distribution of quadratic residues, and in… … Wikipedia
Chebyshev's bias — In prime number theory, Chebyshev s bias is the phenomenon that most of the time, there are more primes of the form 4k + 3 than of the form 4k + 1, up to the same limit. This phenomenon was first observed by Chebyshev in 1853 … Wikipedia
Cubic reciprocity — is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence x3 ≡ p (mod q) is solvable; the word reciprocity comes from the form of the main theorem, which states that … Wikipedia
