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.

Algebra: Structure And Method, Book 1
(REV)00th Edition
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Chapter5: Factoring Polynomials
Section5.4: Multiplying Binomials Mentally
Problem 49WE
icon
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
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage