I know that using a corollary that the congruence x2 ≡ 0 (mod p) that the only solutions are + and - 1 but thats when p is prime. How would i go about proving this... Prove that if n ≡ 2(mod 4), then n can't be written as am for any integer m with m > 1.
I know that using a corollary that the congruence x2 ≡ 0 (mod p) that the only solutions are + and - 1 but thats when p is prime. How would i go about proving this... Prove that if n ≡ 2(mod 4), then n can't be written as am for any integer m with m > 1.
Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.5: Congruence Of Integers
Problem 29E: 29. Find the least positive integer that is congruent to the given sum, product, or power.
a. ...
Related questions
Question
I know that using a corollary that the congruence x2 ≡ 0 (mod p) that the only solutions are + and - 1 but thats when p is prime. How would i go about proving this...
Prove that if n ≡ 2(mod 4), then n can't be written as am for any integer m with m > 1.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,