discrete math

5= (1+4)
(1+4)^n= 1^n + 2*1*4 + ...+4^n

which is 1 mod 4

Prove that 5^n = 1 (mod 4) for any n >or= 1.

  1. 👍
  2. 👎
  3. 👁

Respond to this Question

First Name

Your Response

Similar Questions

  1. Discrete Math

    Congruence True or False: (give reason) _ __ 2 ∈ 18 (mod 8) Can someone please help with this problem? I'm confused. . . Thanks for any helpful replies.

  2. Boundedness of a Sequence

    Question : How do we prove that the sequence (1+(1/n))^n is bounded? My thoughts on this question : We know that, to prove a sequence is bounded, we should prove that it is both bounded above and bounded below. We can see that all

  3. college math

    what is the remainder when the sum 1^5+2^5+3^5+...99^5+100^5 is divided by 4? again a mod problem that I don't know how to work.

  4. Math

    Find all numbers $r$ for which the system of congruences: x == r mod 6 x == 9 mod 20 x == 4 mod 45 has a solution.

  1. Math (Proof)

    Prove that if ab = ac (mod n) and a is relatively prime to n, then b = c (mod n). Proof: a and n are relatively prime and from ab = ac(mod n), we have n|(ab-ac), so n|a(b-c). Since (a,n)=1 (relatively prime), we get n(b-c). hence

  2. Math

    Prove that a^3 ≡ a (mod 3) for every positive integer a. What I did: Assume a^3 ≡ a (mod 3) is true for every positive integer a. Then 3a^3 ≡ 3a (mod 3). (3a^3 - 3a)/3 = k, where k is an integer a^3 - a = k Therefore, a^3

  3. Math

    Prove this using direct proof in paragraph form Given:M is the midpoint of XY Prove: XM=YM

  4. Computers

    1. An 7-bit counter is wired as follows: The CLK input to the first stage (LSB) is the system clock. Each stage's output is used as the CLK input to the next higher stage. This counter is a: A. MOD 128 ripple counter B. MOD 256

  1. probability

    how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)

  2. number theory

    give an example to show that a^2 congruent to b^2 mod n need not imply that a congruent to b mod n.

  3. Math

    Which Statements of congruence are true and which are false and why? 177 _= 17 (mod 8) 871 _= 713 (mod 29) 1322 _= 5294 (mod 12) 5141 _= 8353 (mod 11) 13944 _= 8919 (mod 13) 67 x 73 _= 1 x 3 (mod 5) 17 x 18 x 19 x 20 _= 4! (mod 8)

  4. Discrete Math

    Prove that for all positive integers “a” and “b”, GCD(a,b) = LCM(a,b) iff a = b. Can someone explain me how to prove this? I'm confused. This is for Discrete Math.

You can view more similar questions or ask a new question.