# GATE2005-13

1.9k views

The set $\{1, 2, 4, 7, 8, 11, 13, 14\}$ is a group under multiplication modulo $15$. The inverses of $4$ and $7$ are respectively:

1. $3$ and $13$
2. $2$ and $11$
3. $4$ and $13$
4. $8$ and $14$

edited

Option C.

Identity element here is $1.$
$4 * 4 \mod 15 = 1$
$7 * 13 \mod 15 = 1.$

selected by
13

It is same as finding modular inverse, which is also last step in RSA.

You may likely to know actual procedure for even big numbers-

https://goo.gl/ZCza9r

​​​​​​​

0
How the identity element is 1?
0
An Identity element is an element which leaves other elements unchanged when combined with them.

e.g a # e = a  Here e is an identity element, # is any random operator.

For multiplication,1 multiplying with any other number gives that number itself.

e.g,   5 x 1 = 5

Hence 1 is an identity element with respect to multiplication.
0
$\\ 4d\equiv 1(mod15)\\ GCD(4,15)=1\ How?\\ 15=4*3+3\\ 4=3*1+\mathbf{1}\\ Now\ to\ find\ inverse\ of\ 4\ backtrack\ euclidean\ algorithm\\ 1=4-3*1\\ 1=4-1(15-4*3)\\ 1= 4.4-15.1\\ Taking\ (Mod 15) \ on\ both\ sides\\ 1mod(15)=4.4\\ Hence\ inverse\ of\ 4\ is\ 4$

## Related questions

1
2.7k views
Consider the set $H$ of all $3 * 3$ matrices of the type $\left( \begin{array}{ccc} a & f & e \\ 0 & b & d \\ 0 & 0 & c \end{array} \right)$ where $a,b,c,d,e$ and $f$ are real numbers and $abc ≠ 0.$ Under the matrix multiplication operation, the set $H$ is: a group a monoid but not a group a semi group but not a monoid neither a group nor a semi group
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be: $O(n)$ $O(n \log n)$ $O \left( n^{\frac{3}{2}} \right)$ $O\left(n^3\right)$
Let $f: B \to C$ and $g: A \to B$ be two functions and let $h = f o g$. Given that $h$ is an onto function which one of the following is TRUE? $f$ and $g$ should both be onto functions $f$ should be onto but $g$ need not to be onto $g$ should be onto but $f$ need not be onto both $f$ and $g$ need not be onto
Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE? $R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence relations $R$ $∪$ $S$ is an equivalence relation $R$ $∩$ $S$ is an equivalence relation Neither $R$ $∪$ $S$ nor $R$ $∩$ $S$ are equivalence relations