Question: Let n be a positive odd integer. Prove that n4 1 (mod 16). You may use any of the mod rules provided in class or
Let n be a positive odd integer. Prove that n4 1 (mod 16). You may use any of the mod rules provided in class or the recommended course text book.

1) Let n be a positive odd integer. Prove that n* = 1 (mod 16). You may use any of the mod rules provided in class or the recommended course text book. (In addition, if you end up getting an expression of the form a(3a+l) somewhere in your work where a is an integer, separately end up proving that this expression is always even and use that result to complete your proof.) 1) Let n be a positive odd integer. Prove that n* = 1 (mod 16). You may use any of the mod rules provided in class or the recommended course text book. (In addition, if you end up getting an expression of the form a(3a+l) somewhere in your work where a is an integer, separately end up proving that this expression is always even and use that result to complete your proof.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
