Question

In: Advanced Math

Let “ ·n” be multiplication modulo n, and consider the set Un = { [a] ∈...

Let “ ·n” be multiplication modulo n, and consider the set Un = { [a] ∈ Zn | there is a [b] ∈ Zn with [a] ·n [b] = [1]}

(a) Show that (Un, ·n ) is a group.

(b) Write down the Cayley table for U5. Hint: |U5| = 4.

(c) Write down the Cayley table for U12. Hint: |U12| = 4.

Solutions

Expert Solution

here i am using defination of group that is closed,associative ,identity and inverse .and remaining answers depends on group all answers are below thank you.


Related Solutions

Un = {x ∈ Zn* | x & n are relatively prime}; w/ operator multiplication modulo(n)...
Un = {x ∈ Zn* | x & n are relatively prime}; w/ operator multiplication modulo(n) show: Un is a commutative group.
Let (Un, U, n>1) be asequence of random variables such that Un and U are independent,...
Let (Un, U, n>1) be asequence of random variables such that Un and U are independent, Un is N(0, 1+1/n), and U is N(0,1), for each n≥1. Calculate p(n)=P(|Un-U|<e), for all e>0. Please give details as much as possible
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...
a) Suppose that a ∈ Z is a unit modulo n. Prove that its inverse modulo...
a) Suppose that a ∈ Z is a unit modulo n. Prove that its inverse modulo n is well defined as a residue class in Zn, and depends only on the residue class a in Zn. b) Let Z × n ⊆ Zn be the set of invertible residue classes modulo n. Prove that Z × n forms a group under multiplication. Is this group a subgroup of Zn? c) List the elements of Z × 9 . How many...
Let S be a set of n numbers. Let X be the set of all subsets...
Let S be a set of n numbers. Let X be the set of all subsets of S of size k, and let Y be the set of all ordered k-tuples (s1, s2,   , sk) such that s1 < s2 <    < sk. That is, X = {{s1, s2,   , sk} | si  S and all si's are distinct}, and Y = {(s1, s2,   , sk) | si  S and s1 < s2 <    < sk}. (a) Define a one-to-one correspondence f : X → Y. Explain...
Let Un×n be an upper triangular matrix of rank n. If any arithmetic operation takes 1µ...
Let Un×n be an upper triangular matrix of rank n. If any arithmetic operation takes 1µ second on a computing resource, compute the time taken to solve the system Ux = b, assuming it has a unique solution. What would be the time taken if Un×n is lower triangular
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...
Let S be the set of all ordered pairs of real numbers. Define scalar multiplication and...
Let S be the set of all ordered pairs of real numbers. Define scalar multiplication and addition on S by: α(x1,x2)=(αx1,αx2) (x1,x2)⊕(y1,y2)=(x1 +y1,0) We use the symbol⊕to denote the addition operation for this system in order to avoid confusion with the usual addition x+y of row vectors. Show that S, together with the ordinary scalar multiplication and the addition operation⊕, is not a vector space. Test ALL of the eight axioms and report which axioms fail to hold.
c) Let R be any ring and let ??(?) be the set of all n by...
c) Let R be any ring and let ??(?) be the set of all n by n matrices. Show that ??(?) is a ring with identity under standard rules for adding and multiplying matrices. Under what conditions is ??(?) commutative?
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.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT