- 5 25 Points Let N Be An Integer Prove That If 3 Does Not Divide N2 1 Then 3 Divides N 1 (10.77 KiB) Viewed 32 times
5. (25 points) Let n be an integer. Prove that if 3 does not divide n2 – 1, then 3 divides n.
5. (25 points) Let n be an integer. Prove that if 3 does not divide n2 – 1, then 3 divides n.
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
5. (25 points) Let n be an integer. Prove that if 3 does not divide n2 – 1, then 3 divides n.
This needs to be shown by a written out proof.
5. (25 points) Let n be an integer. Prove that if 3 does not divide n2 – 1, then 3 divides n.
5. (25 points) Let n be an integer. Prove that if 3 does not divide n2 – 1, then 3 divides n.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!