∑ZWMath CoursesSyllabusExercises
ES
ZWMath›Elementary number theory›Orders and quadratic residues›Quadratic residue›ZW-QUADRATIC-RESIDUE-001
Course menu
AreaNumber theoryCourseElementary number theoryTopicOrders and quadratic residues
Divisibility and factorization10
  • Bézout's identity
  • Extended Euclidean algorithm
  • Euclid's lemma
  • Fundamental theorem of arithmetic
  • Least common multiple
  • Infinitude of primes
  • Linear Diophantine equation
  • Greatest common divisor Discrete mathematics
  • Euclidean algorithm Discrete mathematics
  • Prime number Discrete mathematics
Congruences9
  • Complete residue system
  • Modular inverse
  • Linear congruence
  • Chinese remainder theorem
  • Fermat's little theorem
  • Euler's totient function
  • Euler's theorem
  • Wilson's theorem
  • Modular congruence Discrete mathematics
Orders and quadratic residues6
  • Multiplicative order
  • Primitive root
  • Quadratic residue
  • Legendre symbol
  • Euler's criterion
  • Law of quadratic reciprocity
Arithmetic functions5
  • Multiplicative arithmetic function
  • Divisor functions
  • Perfect number
  • Möbius function
  • Möbius inversion formula
Continued fractions and Diophantine equations4
  • Continued fraction
  • Convergent of a continued fraction
  • Pell's equation
  • Sum of two squares
Primes and cryptography3
  • RSA cryptosystem
  • Fermat primality test
  • Prime number theorem

Exercise · ZW-QUADRATIC-RESIDUE-001 · ★☆☆ Basic

Which of these integers is a quadratic residue modulo 7?

Choose one option.

Show answer
  • C. 4

← Back to the question

Explanation

Since 2² = 4, the residue 4 is a square modulo 7. The residue 3 has no square root modulo 7.

Study Elementary number theory in ZWMath →

Review the concept: Quadratic residue

A quadratic residue modulo n is an integer a with gcd(a,n)=1 such that the congruence x² ≡ a (mod n) has a solution. If it has no solution, a is a quadratic nonresidue.

\[x^2 \equiv a \pmod{p}\]

More practice problems: quadratic residue

  • ZW-QUADRATIC-RESIDUE-002 State the definition of a quadratic residue modulo n for an integer a with gcd(a,n)=1.
  • ZW-QUADRATIC-RESIDUE-003 What is the set of nonzero quadratic residues modulo 5?
  • ZW-QUADRATIC-RESIDUE-004 Give the number of nonzero quadratic residues modulo an odd prime p.
  • ZW-QUADRATIC-RESIDUE-005 Which of these residues is a quadratic nonresidue modulo 11?
  • ZW-QUADRATIC-RESIDUE-006 Compute the nonzero quadratic residues modulo 9 and state how many there are.
  • ZW-QUADRATIC-RESIDUE-007 Decide whether 2 is a quadratic residue modulo 17 by computing the squares of the residues from 1 t…
  • ZW-QUADRATIC-RESIDUE-008 Solve x² ≡ 4 (mod 15) and count how many solutions exist modulo 15.
  • ZW-QUADRATIC-RESIDUE-009 Determine whether 3 is a quadratic residue modulo 13 by testing the squares of 1 through 6.

ZW-QUADRATIC-RESIDUE-002 →

Practice

⏱Exam simulator10 random questions with a grade☰All exercises
◉Open on course✦Open on free study↗Open on the map

ZWMath · Math from definition to practice. Open the interactive map · Syllabus · All exercises

Author: ORCID iD 0009-0009-8641-3511

Privacy · About Speedrunz · Contact