Thursday

September 18, 2014

September 18, 2014

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

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.

**Answer this Question**

**Related Questions**

Mathematical induction. I'm stuck. So far I have.. - For all integers n ≥ ...

math - A certain football league has the following scoring system: - each field ...

Discrete Math - Let a, b, c, and d be integers, and let n be a positive integer...

math - Can someone help me with prime and composite numbers? Prime numbers are ...

discrete math - use a direct proof to show that the product of two odd numbers ...

IB HL Math - I need to that if there is better way to prove the following: I am ...

geometry - Rewrite the statement in if-then form. All equilateral triangles have...

Calculus - Use mathematical induction to prove that the statement holds for all ...

AP Calc - Use mathematical induction to prove that the statement holds for all ...

Geometry - PQR is congruent to DJE. complete the statement below PR is congruent...