(1) Show that if H ≤ Sn, then exactly one of the following two cases holds:
(a) All elements of H are even.
(b) The number of even permutations of H is the same as that of odd permutations of H.
(2) Show that if (Sn : H) = 2, then H = An


(1) Show that if H ≤ Sn, then exactly one of the following two cases holds:...
Problem 2: Let pı .. .pn E Sn be a permutation, considered in its one-line notation. A descent in p is an index 1 < i S n 1 such that p, > Pi+1. How many permutations in Sn have exactly one descent?
Problem 2: Let pı .. .pn E Sn be a permutation, considered in its one-line notation. A descent in p is an index 1 Pi+1. How many permutations in Sn have exactly one descent?
In each of the following cases, give an algorithm that uses exactly one random number of generating a random variate with the same distribution as A (a) X-min(X,5) where Yi and Y2 are IID exponential with common rate λ. (b) X = max(Yİ, YS} where Y1 and Y2 are IID exponential with connmon rate λ.
Problem 2: Let pı .. .pn E Sn be a permutation, considered in its one-line notation. A descent in p is an index 1 < i S n 1 such that p, > Pi+1. How many permutations in Sn have exactly one descent?
4. List all left cosets of An in Sn. (See 3.7.11.) For a given permutation o in Sn, how can you tell from o which coset o An is? Example 3.7.11. Pick a positive integer n > 2 and consider the group S. We define An = {o ESO is an even permutation). We will use the first theorem above to verify that An is a subgroup of S First of all, the identity is defined to be an even...
USING MATLB PLEASE SHOW commands and output. QUESTION 1. Create a function sumcomp that compares the sum of all the odd-indexed elements with the sum of all the even-indexed elements and returns: 0, if they are equal, 1, if the sum of the odd-indexed elements is greater, 2, if the sum of the even-indexed elements is greater
Compute the sign of the following permutations: (a) (1, 4, 3, 6, 7)(5, 8, 9, 10). (b) σ ∈ Sn, i 7→ n + 1 − i. (c) Show that this initial configuration of the 15 puzzle is not solvable 3 1 15 13 2 8 5 9 12 7 11 4 14 6 10 − (d) Suppose that (i, j) ∈ Sn is a transposition and that i < j. Find an expression (in terms of i and j...
You are given that at least one of the events An, 1 sn SN, is certain to occur. However, certainly no more than two occur. If P(An ) = p and P(Ann Am ) = 9, men , then show that P2 and qs 2
1) For breakfast, Robert always selects one item from each of the following: (Orange juice or Grapefruit juice), (Eggs or Hash brown), and (Toast or Bagels). Draw a tree diagram to show all his possible menus. 2) Two fair dice are rolled. Find the probability of each of the following events. (Hint: Construct a sample space). a) Getting even dots on both dice. b) Getting a sum of 5 on both dice. c) Getting an even number of dots on...
Let w e Sbe a permutation which rearranges 8 objects identified with letters, altering their positions to become as in the lower line of what follows: [A B C D E F G H (F DAEH C B G a) Express w as a product of disjoint cycles. Is w an even permutation, or an odd permutation? What is its order? b) Calculate wy, w and w-2 as products of disjoint cycles. c) Does there exist TE Sg for which...
Two ordered trees T1 and T2 are called isomorphic if one of the following conditions holds true: Both T1 and T2 are empty. Both T1 and T2 comprises a single node. Both T1 and T2 have the same number of k _ 1 of subtrees, and the i-th subtree of T1 is isomorphic to the i-th subtree Ti for i = 1; 2; :::; k. Design an algorithm to test if two given ordered trees are isomorphic. What is the...