Let f(x) be a fixed integer polynomial, and let m be a fixed positive integer. Denote the number of solutions to f(x) = k (mod m) by N(k). Prove that m-1 ΣN(k) = k=0 = m.

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter4: Polynomial And Rational Functions
Section4.3: Zeros Of Polynomials
Problem 2E
icon
Related questions
Question

[Algebraic Cryptography] How do you solve this?

Let f(x) be a fixed integer polynomial, and let m be a fixed positive integer. Denote the number of solutions to
f(x) = k (mod m) by N(k). Prove that
m-1
ΣN (k) =
k=0
= m.
Transcribed Image Text:Let f(x) be a fixed integer polynomial, and let m be a fixed positive integer. Denote the number of solutions to f(x) = k (mod m) by N(k). Prove that m-1 ΣN (k) = k=0 = m.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Trigonometry (MindTap Course List)
Trigonometry (MindTap Course List)
Trigonometry
ISBN:
9781337278461
Author:
Ron Larson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning