• edited by
6,959 views
34 34 votes

Let $S= \{0, 1, 2, 3, 4, 5, 6, 7\}$ and $⊗$ denote multiplication modulo $8,$ that is, $x ⊗ y= (xy) \mod 8$

  1. Prove that $( \{ 0, 1\}, ⊗)$ is not a group.
  2. Write three distinct groups $(G, ⊗)$ where $G ⊂ S$ and $G$ has $2$ elements.

4 Answers

Best answer
44 44 votes

$\begin{array}{c|cc}
⊗&0&1\\ \hline
0&0&0\\
1&0&1
\end{array}$

a. $1$ is the identity element. Inverse does not exist for zero. So, it is not a group.

b. $\begin{array}{c|cc}
⊗&1&3\\ \hline
1&1&3\\
3&3&1
\end{array}\qquad\begin{array}{c|cc}
⊗&1&5\\\hline1&1&5\\
5&5&1
\end{array}\qquad\begin{array}{c|cc}
⊗&1&7\\\hline1&1&7\\
​7&7&1
\end{array}$

• edited by
1 1 vote
A- see best answer

B-In Set S numbers which are Co-prime to 8 are 3,5,7 so inverse exist of these numbers and 1 is identity while 0,2,4,6 are not co-prime to 8 so inverse does not exist so we can form pair (1,3)(1,5)(1,7) and these pair form  group under multiplication modulo
0 0 votes

({0,1},⊗) is not a group  because : (0e)mod8=0 is haing e=0 as identity but (1e)mod8=1 should have 1 as identity so no single identity is there.

({1,7}, ⊗ ) :

   1. closed

   2. associative

   3. Identity = 1

   4. inerse:  1-1=7 , 7-1=1

can someone suggest 2 more subgroups.

0 0 votes

(a)In S we have identity element e=1 for multiplication modulo 8 operation.

For Inverse(2) we have to find number x from set s such that  (2x)mod8=1(e).

 Now as you can see 2x will be of ther form 8x+1(then only remainder 1 possible).

8x+1 will always be odd number and any nymber multiplied by 2 will always be even. Therefore no such x exists. Inverse(2)=DNE.

Therefore not Group (We could also have used co prime logic in this group but i like this method).

(b)Moreover for 3 groups we need 1 in each group beacuse it is the identity element for the operation.

Therfore the groups are:-

{1,3}   Inverse(3)=3

{1,5} Inverse(5)=5

{1,7} Inverse(7)=7

All  3 Structure follow closure,Aassociative,e=1, and inverse property.Therfore these 3 are groups and subset of s Therefore subgroups

Position:
Show:

Related questions

51 51 votes
8 answers 8 answers
18.1k
18.1k views
Kathleen asked Sep 14, 2014
18,075 views
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetiti...
66 66 votes
11 answers 11 answers
12.8k
12.8k views
Kathleen asked Sep 14, 2014
12,803 views
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertice...
13 13 votes
1 answers 1 answer
2.5k
2.5k views
Kathleen asked Sep 14, 2014
2,543 views
Consider the following sequence:$s_1 = s_2 = 1$ and $s_i = 1 + \min \left({s_{i-1}, s_{i-2}}\right) \text{ for } i 2$.Prove by induction on $n$ that $s_n=⌈\frac{n}{2}⌉$...
46 46 votes
4 answers 4 answers
14.4k
14.4k views
Kathleen asked Sep 14, 2014
14,403 views
A polynomial $p(x)$ satisfies the following:$p(1) = p(3) = p(5) = 1$ $p(2) = p(4) = -1$The minimum degree of such a polynomial is$1$$2$$3$$4$