Homework Help: math

Posted by Anna on Wednesday, April 6, 2011 at 9:14pm.

Prove eachh mathematical statement for integers m,n,k,p,a,b

12. For every prime p and nonzero n we have n^2 is congruent to nMODp if and only if either n is congruent to 1MODp or n is congruent to 0MODp.

No one has answered this question yet.

Answer this Question

Related Questions

Discrete Math - Let a, b, c, and d be integers, and let n be a positive integer...
AP Calc - Use mathematical induction to prove that the statement holds for all ...
Calculus - Use mathematical induction to prove that the statement holds for all ...
discrete math - which positive integers less than 12 are relatively prime to 13 ...
Math - Use mathematical induction to prove that 2^(3n) - 3^n is divisible by 5 ...
math - A certain football league has the following scoring system: - each field ...
A number thoery question - Please help me! Thank you very much. Prove Fermat'...
IB HL Math - I need to that if there is better way to prove the following: I am ...
math induction - prove the product of 4 consecutive integers is always divisible...
MATH - Let’s agree to say that a positive integer is prime-like if it is ...

For Further Reading

First Name:
School Subject:
Answer: