(a) Let n = 2k be an even integer. Show that x = rk is an...

(a) Let n = 2k be an even integer. Show that x = r^k is an element of order 2 which commutes with every element of D_n.

(b) Let n = 2k be an even integer. Show that x = r^k is the unique non-identity element which commutes with every element of D_n.

(c) If n is an odd integer, show that the identity is the only element of D_n which commutes with every element of D_n.

Expert Solution

Colby Messinger answered 2 years ago

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 if n is an integer and n^2 is even the n is even.

Partitions Show that the number of partitions of an integer n into summands of even size...

Partitions Show that the number of partitions of an integer n into summands of even size is equal to the number of partitions into summands such that each summand occurs an even number of times.

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?

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) )

prove that if an even integer n is subtracted from an odd integer m. then m...

prove that if an even integer n is subtracted from an odd integer m. then m - n is odd.

In this question we show that we can use φ(n)/2. Let n = pq. Let x...

In this question we show that we can use φ(n)/2. Let n = pq. Let x be a number so that gcd(x, n) = 1. 1. show that xφ(n)/2 = 1 mod p and xφ(n)/2 = 1 mod q 2. Show that this implies that and xφ(n)/2 = 1 mod n 3. Show that if e · d = 1 mod φ(n)/2 then xe·d = 1 mod n. 4. How can we use φ(n)/2 in the RSA? Please explain answers...

Let n be a positive integer. Let S(n) = n sigma j=1 ((1/3j − 2) −...

Let n be a positive integer. Let S(n) = n sigma j=1 ((1/3j − 2) − (1/3j + 1)). a) Compute the value of S(1), S(2), S(3), and S(4). b) Make a conjecture that gives a closed form (i.e., not a summation) formula for the value of S(n). c) Use induction to prove your conjecture is correct.

Consider an n×n square board, where n is a fixed even positive integer. The board is...

Consider an n×n square board, where n is a fixed even positive integer. The board is divided into n 2 unit squares. We say that two different squares on the board are adjacent if they have a common side. N unit squares on the board are marked in such a way that every unmarked square on the board is adjacent to at least one marked square. Determine the smallest possible value of N.

2. Let x be a real number, and consider the deleted neighborhood N∗(x;ε). (a) Show that...

2. Let x be a real number, and consider the deleted neighborhood N∗(x;ε). (a) Show that every element of N∗(x;ε) is an interior point. (b) Determine the boundary of N∗(x;ε) and prove your answer is correct.

Question