Question: Let n Z+ with n > 1. a) If n = 2k where k is an odd integer, prove that k3 =k (mod n).

Let n ˆˆ Z+ with n > 1.
a) If n = 2k where k is an odd integer, prove that
k3 =k (mod n).
b) If n = 4k for some k ˆˆ Z+, prove that
(2k)2 = 0 (mod ft).
c) Prove that
Let n ˆˆ Z+ with n > 1.a) If n

10(modn), otherwise. with or n even old. (mod n otherwise.

Step by Step Solution

3.42 Rating (161 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Proof a For n 2 and k 1 we have l 3 1 and l 3 1 mod 2 When n 2 then k 3 k ... View full answer

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

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8449).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!