## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

n≤20. If there is a conjecture to be made, can it be proven? n 2 3 4 5 6 7 *8 9 10 11 *12 13 14 *15 *16 17 18 19 *20 Order 1 2 2 4 2 6 4 6 4 10 4 12 6 8 8 16 6 18 8 1 2 2 4 2 6 2 6 4 10 2 12 6 4 4 16 6 18 4 Exponent Generators 1 2 3 2 5 3 7, 3 2 3 2 5, 7 2 3 14, 2 15, 3 3 5 2 19, 3

(Table 1: U(n) for n=1 to 20, with order, exponent and generating set)

From above, we can see that U(n) is cyclic for n≠8,12,15,16 and 20. Note that for n=8,12,15,16 and 20 the order and exponent are not equal. *Conjecture: U(n) is cyclic when the order and exponent are equal

Proof: (by contradiction) -Assume that U(n) is cyclic when the order and exponent are different (not equal) Consider U(3): *U(3) = {1,2} *21=2, 22=4=1 mod 3, 23=8=2 mod 3, 24=1...thus 2 is a generator for U(3) *Therefore U(3) is cyclic However, from the table above the order of U(3) = the exponent of U(3) = 2. →← Contradiction *U(3) is cyclic, but it's order and exponent are identical, therefore U(n) is cyclic when the order and exponent are the same by contradiction. QED ___________________________________________________________________________________ Ch 5 #6) ***Already graded, see attached*** Ch 5 #19) Prove that Dn is nonabelian for n≥3 Proof: (by induction) Base case: Let n=3 s,r ∈ D3 (s = reflection, r = rotation) *r(A) = B, r(B) = C, r(C) = A *s(A) = A, s(B) = C, s(C) = B rs(A) = B and sr(A) = C, thus sr≠rs, therefore D3 is nonabelian *Therefore, there exists a k≥3 such that Dk is nonabelian Consider k+1: since k≥3, then k+1≥3 s,r ∈Dk+1 *r(1) = 2, r(2) = 3, … , r(k) = k+1, r(k+1) = 1 *s(1) = 1, s(2) = k+1, s(3) = k, …

rs(1) = 2 and sr(1)= k+1, thus sr≠rs, therefore Dk+1 is nonabelian *Therefore Dn is nonabelian for n≥3 by induction QED ___________________________________________________________________________________ Ch 5 #25) Prove that An for n≥3, any permutation is a product of cycles with length 3. Proof: (by exhaustion) *Any permutation can be written as a product of even transpositions e.g. (a,b,c) = (ac)(ab) For transpositions of this form, there are three unique cases: *Case 1: Transpositions are disjointed WLOG, let (a,b)(c,d) represent a disjointed permutation. (a,b)(c,d) = (a,b,c)(b,c,d), therefore it is product of 3-length cycles also *Case 2: Transpositions have one repeated element WLOG, let b repeat, so let (a,b)(b,c) represent a permutation with one repeated element. (a,b)(b,c) = (a,b,c), therefore it is product of 3-length cycles also *Case 3: Transpositions have two repeated elements WLOG, let (a,b)(b,a) represent a permutation with two repeated elements. But (a,b) = (b,a), so (a,b)(b,a) = (a,b)(a,b) (a,b)(a,b) = id, which can also be written as a 3-length cycle For every transposition of these forms, the permutation is a product of cycles with length 3, therefore the statement is true by exhaustion. QED

Ch 6 #3) Prove or disprove that every subgroup of Z has a finite index. Proof: (by counterexample) The question does not clarify whether or not these are non-empty subgroups. The statement is false as read, since {0} has an infinite index. Therefore every subgroup of Z does not have a finite index by counterexample. QED

- HCR's Rank Formula (a Greatest Logical Formula)
- History Fpt 5
- AMS301-Homework 6 Solutions
- Document 11
- Tutorial 02_s.pdf
- Untitled
- Group Theory 1
- Tutorial 9A
- ON THE CONVERGENCE OF THE ERDOS HARMONIC SERIES
- H. Bombin and M.A. Martin-Delgado- Topological Quantum Distillation
- Appendix a Matrix Algebra 2013 the Finite Element Method Its Basis and Fundamentals Seventh Edition
- combinatios
- Fundamental Counting Principle
- Properties of Logarithmic Function
- Solutions Manual Digital Control System Analysis Design 4th Edition Charles L. Phillips Troy Nagle Aranya Chakrabortty
- Definition of Function
- Chapter 14
- IIJEC-2014-09-28-10
- 5. Indices & Log
- Lesson 4
- F4 Add Maths Annual Scheme of Work_2010
- Taylor Series Notes
- HA 082 Slide4P
- Binomial Theorem
- On the Product of the Square-free Divisor of a Natural Number
- Exponentials & Logarithms
- Chain Rule
- PadicNumbersA
- JNF
- dualhom8

Skip carousel

- 51931_1935-1939
- Virtual 2014 Appendices b and c Notes Final 0
- 45173_1935-1939
- bls_1382_1964.pdf
- bls_1376_1963.pdf
- 45177_1935-1939
- bls_0718_1942.pdf
- bls_0390_1925.pdf
- 51812_1935-1939
- bls_0415_1926.pdf
- 53235_1940-1944
- 45174_1935-1939
- 53225_1935-1939
- 45174_1930-1934
- bls_0493_1929.pdf
- bls_1554_1967.pdf
- 53224_1935-1939
- bls_0521_1930.pdf
- 45173_1930-1934
- bls_1143_1953.pdf
- bls_0947_1949.pdf
- 45174_1925-1929
- bls_0973_1950.pdf
- bls_1007_1951.pdf
- bls_1411_1963.pdf
- bls_0572_1933.pdf
- bls_0367_1925.pdf
- 45173_1925-1929
- bls_0335_1923.pdf
- 53795_1940-1944

Sign up to vote on this title

UsefulNot usefulRead Free for 30 Days

Cancel anytime.

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading