3.11. (a) Let n be any integer such that n is congruent to 0 (mod 7)....

3.11. (a) Let n be any integer such that n is congruent to 0 (mod 7). For any positive integer k, what is the remainder when n^k is divided by 7?

(b) Let n be any integer such that n is congruent to 1 (mod 7). For any positive integer k, what is the remainder when n^k is divided by 7?

(c) Let n be any integer such that n is congruent to 2 (mod 7). For any nonnegative integer k, what is the remainder when (i) n^3k is divided by 7? (ii) n^3k+1 is divided by 7? (iii) when n^3k+2 is divided by 7?

(d) Let n be any integer such that n is congruent to 3 (mod 7). For any nonnegative integer k, what is the remainder when (i) n^3k is divided by 7? (ii) n^3k+1 is divided by 7? (iii) when n^3k+2 is divided by 7?

Solutions

Expert Solution

Colby Messinger answered 1 year ago

Next > < Previous

Related Solutions

Let p be an odd prime and a be any integer which is not congruent to...

Let p be an odd prime and a be any integer which is not congruent to 0 modulo p. Prove that the congruence x 2 ≡ −a 2 (mod p) has solutions if and only if p ≡ 1 (mod 4). Hint: Naturally, you may build your proof on the fact that the statement to be proved is valid for the case a = 1.

0 mod 35 = 〈0 mod 5, 0 mod 7〉 12 mod 35 = 〈2 mod...

0 mod 35 = 〈0 mod 5, 0 mod 7〉 12 mod 35 = 〈2 mod 5, 5 mod 7〉 24 mod 35 = 〈4 mod 5, 3 mod 7〉 1 mod 35 = 〈1 mod 5, 1 mod 7〉 13 mod 35 = 〈3 mod 5, 6 mod 7〉 25 mod 35 = 〈0 mod 5, 4 mod 7〉 2 mod 35 = 〈2 mod 5, 2 mod 7〉 14 mod 35 = 〈4 mod 5, 0 mod 7〉...

For m, n in Z, define m ~ n if m (mod 7) = n (mod...

For m, n in Z, define m ~ n if m (mod 7) = n (mod 7). a. Show that -341 ~ 3194; that is to say 341 is related to 3194 under (mod 7) operation. b. How many equivalence classes of Z are there under the relation ~? c. Pick any class of part (b) and list its first 4 elements. d. What is the pairwise intersection of the classes of part (b)? e. What is the union of...

Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod...

Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod 4) or n ≡ 3 (mod 4), then n is not a perfect square.

For any nonnegative integer n, let Y1 < Y2 < · · · < Y2n+1 be...

For any nonnegative integer n, let Y1 < Y2 < · · · < Y2n+1 be the ordered statistics of 2n + 1 independent observations from the uniform distribution on [−2, 2]. (i) Find the p.d.f. for Y1 and the Y2n+1. (ii) Calculate E(Yn+1). Use your intuition to justify your answer.

4. Let n ≥ 8 be an even integer and let k be an integer with...

4. Let n ≥ 8 be an even integer and let k be an integer with 2 ≤ k ≤ n/2. Consider k-element subsets of the set S = {1, 2, . . . , n}. How many such subsets contain at least two even numbers?

Prove that for any integer n the expression n7/7 + n5/5 + 23n/35 is whole integer....

Prove that for any integer n the expression n7/7 + n5/5 + 23n/35 is whole integer. (Hint: Note that the problem can be state in a following equivalent form: 35 | (5n7 +7n5 +23n); even further, by the previews theorem, it would be enough to show that (5n7 + 7n5 + 23n) is divisible by 5 and 7.)

Let f(x) = {(C/x^n if 1≤ x <∞; 0 elsewhere)} where n is an integer >1....

Let f(x) = {(C/x^n if 1≤ x <∞; 0 elsewhere)} where n is an integer >1. a. Find the value of the constant C (in terms of n) that makes this a probability density function. b. For what values of n does the expected value E(X) exist? Why? c. For what values of n does the variance var(X) exist? Why?

Prove that 3^n + 7^(n−1) ≡ 4 (mod 12) for all n ∈ N+.

Let n be a positive integer. Prove that if n is composite, then n has a...

Let n be a positive integer. Prove that if n is composite, then n has a prime factor less than or equal to sqrt(n) . (Hint: first show that n has a factor less than or equal to sqrt(n) )

Subjects