Answer to Question #71820 in Discrete Mathematics for Mlk

Discrete Mathematics

Question #71820

Prove that for any integer n such that n≡2 mod 3 , n^k≡1 or 2 (mod 3) , where k∈N

Expert's answer

Download Answer

Learn more about our help with Assignments: Discrete Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. Prove the following statement using the first principle of Mathematical Induction: Σ
2. 1. The number 3-540-97285-9 is obtained from a valid ISBN number by switching two consecutive digit
3. Is {1,1,1,10}={1,1,1,1,10}?Justify your answer
4. Consider the Birthday Problem discussed in lecture. In this problem we calculate the probability th
5. Prove or disprove that: i) A-B⊆A-C-B ii)(A-B)∪(B-C)∪(C-A)=(A∪B∪C)-(A∩B∩C)
6. Prove the following : (a) If |A1| = n1, |A2|= n2 and |A3|= n3 then |A1 x A2 x A3| = n1n2n3
7. Deﬁne the relation Q over all R > 1 such that xQy ⇔ x > y2