Question: 3. Prove that for every integer n, if 3|n2 then 3 n. You may use the fact that if u is an integer, then (32)

 3. Prove that for every integer n, if 3|n2 then 3

3. Prove that for every integer n, if 3|n2 then 3 n. You may use the fact that if u is an integer, then (32) iff there is a k e Z such that either I = - 3k + 1 or x=3k + 2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!