Determine which of the following binary operations on the set $N$ are associative and which are commutative: $a \ast b = 1$ for all $a, b \in N$.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(A) $1$. Commutativity: $A$ binary operation $\ast$ on a set $N$ is commutative if $a \ast b = b \ast a$ for all $a, b \in N$. Here,$a \ast b = 1$ and $b \ast a = 1$. Since $1 = 1$,the operation is commutative.
$2$. Associativity: $A$ binary operation $\ast$ on a set $N$ is associative if $(a \ast b) \ast c = a \ast (b \ast c)$ for all $a, b, c \in N$. Here,$(a \ast b) \ast c = 1 \ast c = 1$. Also,$a \ast (b \ast c) = a \ast 1 = 1$. Since $1 = 1$,the operation is associative.
Therefore,the operation is both associative and commutative.

Explore More

Similar Questions

In the group $G=\{0, 1, 2, 3, 4, 5\}$ under addition modulo $6$,$(2 +_{6} 3^{-1} +_{6} 4)^{-1}$ is equal to

Let $^*$ be a binary operation on the set $Q$ of rational numbers defined as $a \,^*\, b = a b^{2}$. Determine whether the operation is commutative and associative.

Let $A = N \times N$ and $^*$ be the binary operation on $A$ defined by $(a, b) \,^*\, (c, d) = (a + c, b + d)$. Determine whether the operation $^*$ is commutative,associative,and has an identity element.

Which one of the following is not true?

Consider a binary operation $*$ on the set $\{1, 2, 3, 4, 5\}$ given by the following multiplication table. Compute $(2 \,^* \,3) \,^* \,(4 \,^* \,5)$.
(Hint: use the following table)
$^*$ $1$ $2$ $3$ $4$ $5$
$1$ $1$ $1$ $1$ $1$ $1$
$2$ $1$ $2$ $2$ $2$ $2$
$3$ $1$ $2$ $3$ $3$ $3$
$4$ $1$ $2$ $3$ $4$ $4$
$5$ $1$ $2$ $3$ $4$ $5$

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo