Confirming the Order of Permutation: LCM = 8

  • Thread starter Thread starter WM07
  • Start date Start date
  • Tags Tags
    Permutation
WM07
Messages
3
Reaction score
0
Can you tell me if my answer is correct?

in (1 2 3 4) (1 2 3 4) The order of permutation is LCM = (4, 4) = 8
 
Physics news on Phys.org
WM07 said:
Can you tell me if my answer is correct?

in (1 2 3 4) (1 2 3 4) The order of permutation is LCM = (4, 4) = 8

The order of the permutation is indeed the LCM of the order of each. However, you may want to double check your math. LCM(4,4) is not 8.

:-)
 
rs1n said:
The order of the permutation is indeed the LCM of the order of each. However, you may want to double check your math. LCM(4,4) is not 8.

:-)


Thank you, I get the least common multiple is 4 am I right?
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

MHB Determine the cycle decomposition of the permutations
Replies
28
Views
3K
MHB The permutation induces on the set
Replies
23
Views
2K
I About permutation acting on the Identity matrix
Replies
7
Views
3K
A What Is the Role of 'n' and the Virgule in the Wedge Product Formalism?
Replies
3
Views
2K
MHB Does the permutation group S_8 contain elements of order 14?
Replies
1
Views
2K
MHB Calculating LCD and GCD of 2 Sets of Numbers
Replies
2
Views
1K
I Permutation group and character table
Replies
6
Views
2K
MHB How many homomorphisms are there from $\mathbb{Z}_4$ to $S_4$?
Replies
2
Views
2K
MHB Question on subgroup and order of the elements
Replies
7
Views
2K
A How do I find the change of basis matrix for the JCF of M?
Replies
6
Views
2K

Hot Threads

Recent Insights

Back
Top