MHB Cayley table (Asnate's 's question at Yahoo Answers)

  • Thread starter Thread starter Fernando Revilla
  • Start date Start date
  • Tags Tags
    Table
Fernando Revilla
Gold Member
MHB
Messages
631
Reaction score
0
Here is the question:

Let group S={0,1,2,3} and define a*b=a+b(mod4)
Write down the Cayley Table for (S,*)
Find the identity element of S.
Find the inverse of each element of S.

Please explain how and why you do each step. Many Thanks

Here is a link to the question:

Cayley Table construction? - Yahoo! Answers

I have posted a link there to this topic so the OP can find my response.
 
Mathematics news on Phys.org
Hello Asnate,

Previous examples: $(a)\;1+2=3$ and the remainder of the euclidean division $3:4$ is $3$ so, $1*2=3$. $(b)\;2+2=4$ and the remainder of the euclidean division $4:4$ is $0$ so, $2*2=0$. $(c)\;2+3=5$ and the remainder of the euclidean division $5:4$ is $1$ so, $2*3=1$ etc. Then, you'll easily verify that the Cayley table is: $$\begin{matrix}{*}&{0}&{1}&2&3\\{0}&{0}&{1}&2&3\\{1}&{1}&{2}&3&0 \\ {2}&{2}&{3}&0&1\\ {3}&{3}&{0}&1&2 \end{matrix}$$ The element $0$ satisfies $x*0=0*x$ for all $x\in S$, hence $0$ is the identity element of $S$.

If $x\in S$, its inverse is the element $x'\in S$ satisfying $x'*x=x*x'=0$. Easily you'll find the inverse of any element of $S$: $$\begin{matrix}{x}&{0}&{1}&2&3\\{x'}&{0}&{3}&2&1 \end{matrix}$$

P.S. I've tried the $\LaTeX$ tabular environment, but it doesn't work.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top