Question

In: Math

(2) Let Z/nZ be the set of n elements {0, 1, 2, . . . ,...

(2) Let Z/nZ be the set of n elements {0, 1, 2, . . . , n ? 1} with addition and multiplication modulo n. (a) Which element of Z/5Z is the additive identity? Which element is the multiplicative identity? For each nonzero element of Z/5Z, write out its multiplicative inverse. (b) Prove that Z/nZ is a field if and only if n is a prime number. [Hint: first work out why it’s not a field when n isn’t prime. Try some small examples, e.g. n = 4, n = 6.]

Expert Solution

(a) The 0 (zero) element of Z/5Z is the additive identity.

The 1 (one) element of Z/5Z is the additive identity.

(b) If n is not prime, then the multiplicative inverse of each element does not exist. Fore example, let n = 6, then we have

So, we see that if n is not prime then at least (n-1)/2 and even number do not have their inverse. So, it can not be a field.

milcah answered 2 years ago

Let the cyclic group {[0], [1], [2], ..., [n − 1]} be denoted by Z/nZ. Consider...

Let the cyclic group {[0], [1], [2], ..., [n − 1]} be denoted by Z/nZ. Consider the following statement: for every positive integer n and every x in Z/nZ, there exists y ∈ Z/nZ such that xy = [1]. (a) Write the negation of this statement. (b) Is the original statement true or false? Justify your answer.

Let A be a set with m elements and B a set of n elements, where...

Let A be a set with m elements and B a set of n elements, where m; n are positive integers. Find the number of one-to-one functions from A to B.

Let A be some m*n matrix. Consider the set S = {z : Az = 0}....

Let A be some m*n matrix. Consider the set S = {z : Az = 0}. First show that this is a vector space. Now show that n = p+q where p = rank(A) and q = dim(S). Here is how to do it. Let the vectors x1, . . . , xp be such that Ax1, . . . ,Axp form a basis of the column space of A (thus each x can be chosen to be some unit...

Prove (Z/mZ)/(nZ/mZ) is isomorphic to Z/nZ where n and m are integers greater than 1 and...

Prove (Z/mZ)/(nZ/mZ) is isomorphic to Z/nZ where n and m are integers greater than 1 and n divides m.

Let G be a group,a;b are elements of G and m;n are elements of Z. Prove...

Let G be a group,a;b are elements of G and m;n are elements of Z. Prove (a). (a^m)(a^n)=a^(m+n) (b). (a^m)^n=a^(mn)

7. Let n ∈ N with n > 1 and let P be the set of...

7. Let n ∈ N with n > 1 and let P be the set of polynomials with coefficients in R. (a) We define a relation, T, on P as follows: Let f, g ∈ P. Then we say f T g if f −g = c for some c ∈ R. Show that T is an equivalence relation on P. (b) Let R be the set of equivalence classes of P and let F : R → P be...

Let A[1 · · · n] be an array of n elements and B[1 · ·...

Let A[1 · · · n] be an array of n elements and B[1 · · · m] an array of m elements. We assume that m ≤ n. Note that neither A nor B is sorted. The problem is to compute the number of elements of A that are smaller than B[i] for each element B[i] with 1 ≤ i ≤ m. For example, let A be {30, 20, 100, 60, 90, 10, 40, 50, 80, 70} of ten...

For each n ∈ N, let fn : [0, 1] → [0, 1] be defined by...

For each n ∈ N, let fn : [0, 1] → [0, 1] be defined by fn(x) = 0, x > 1/n and fn(x) = 1−nx if 0 ≤ x ≤1/n. The collection {fn(x) : n ∈ N} converges to a point, call it f(x) for each x ∈ [0, 1]. Show whether {fn(x) : n ∈ N} converges to f uniformly or not.

Let f(n,k) be the number of equivalence relations with k classes on set with n elements....

Let f(n,k) be the number of equivalence relations with k classes on set with n elements. a) What is f(2,4)? b) what is f(4,2)? c) Give a combinational proof that f(n,k) = f(n-1,k-1)+k * f(n-1,k)

Let Z ∼ Normal(0 , 1) and Y ∼ χ 2 γ , then the new...

Let Z ∼ Normal(0 , 1) and Y ∼ χ 2 γ , then the new r.v. T = √ Z Y /γ has the Student’s t-distribution. The density function of T is fT (t) = Γ[(γ + 1)/2] √γπΓ(γ/2) 1 + t 2 γ !−(γ+1)/2 . (a) (3 points) Describe the similarity/difference between T and Z. (b) (6 points) Let t0 be a particular value of t. Use t-distribution table to find t0 values such that the following statements...