∑ZWMath CoursesSyllabusExercises
ES
ZWMath›Elementary number theory›Orders and quadratic residues›Euler's criterion›ZW-EULER-S-CRITERION-002
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-EULER-S-CRITERION-002 · ★☆☆ Basic

For \(p=11\), which exponent \((p-1)/2\) does the criterion use?

Choose one option.

Show answer
  • B. 5

← Back to the question

Explanation

For \(p=11\) we get \((11-1)/2=5\), which is the exponent of \(a\).

Study Elementary number theory in ZWMath →

Review the concept: Euler's criterion

Criterion that decides whether an integer \(a\) is a quadratic residue modulo an odd prime \(p\) by means of a modular power.

\[\left(\frac{a}{p}\right) \equiv a^{\frac{p-1}{2}} \pmod{p}\]

More practice problems: euler's criterion

  • ZW-EULER-S-CRITERION-001 According to Euler's criterion, what is ((a)/(p)) congruent to modulo p?
  • ZW-EULER-S-CRITERION-003 For which primes p does Euler's criterion hold as stated in this sheet?
  • ZW-EULER-S-CRITERION-004 If a is a quadratic residue modulo p, what is the value of a^(p-1)/2bmod p?
  • ZW-EULER-S-CRITERION-005 If a^(p-1)/2≡ -1pmod p, what can you conclude about a?
  • ZW-EULER-S-CRITERION-006 Use the criterion to decide whether 3 is a quadratic residue modulo 7. What is the correct conclusi…
  • ZW-EULER-S-CRITERION-007 For p=13 and a=5, what is 5^6bmod 13, and what does it mean?
  • ZW-EULER-S-CRITERION-008 What is 2^(5-1)/2bmod 5, and what does it indicate about 2?
  • ZW-EULER-S-CRITERION-009 If a^(p-1)/2≡ 1pmod p and b^(p-1)/2≡ 1pmod p, what is (ab)^(p-1)/2 congruent to modulo p?

← ZW-EULER-S-CRITERION-001 ZW-EULER-S-CRITERION-003 →

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