Math Problem Statement
Show that, If p is an odd prime, then there exist integers a, b, k such that a²+b+1=kp and 0<k<p.
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Number Theory
Quadratic Residues
Modular Arithmetic
Formulas
a² + b + 1 = kp
a² + b ≡ -1 (mod p)
k = (a² + b + 1) / p
Theorems
Quadratic Residues Modulo Prime Theorem
Modulo Arithmetic
Suitable Grade Level
Undergraduate Level (Number Theory)
Related Recommendation
Prove: If p is an Odd Prime, then a² + b² + 1 = kp for Integers a, b, k
Proving Existence of Integers a, b, k for a² + b² + 1 = kp
Proving a^k ≡ 1 (mod p) Given a ≡ b^2 (mod p) and p = 2k + 1
Prove That the Square of Any Integer is of the Form 3k or 3k+1
Prime Number Proof: p ≡ 1 (mod 4) and p ≡ 2 (mod 3)