• edited by
13,902 views
58 58 votes

Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows:

$$\begin{array}{|c|c|c|c|} \hline \textbf{+} & \textbf{a}& \textbf{b} &\textbf{c}\\\hline \textbf{a} & \text{b}& \text{a} & \text{c} \\\hline \textbf{b} & \text{a}& \text{b} & \text{c}\\\hline \textbf{c} & \text{a}& \text{c} & \text{b}\\\hline \end{array}\qquad \begin{array}{|c|c|c|c|} \hline \textbf{*} & \textbf{a}& \textbf{b} &\textbf{c}\\\hline \textbf{a} & \text{a}& \text{b} & \text{c} \\\hline \textbf{b} & \text{b}& \text{c} & \text{a}\\\hline \textbf{c} & \text{c}& \text{c} & \text{b}\\\hline \end{array}$$

For example, \(a + c = c, c + a = a, c * b = c\) and \(b * c = a\).

Given the following set of equations:

  • $(a * x) + (a * y) = c $
  • $(b * x) + (c * y) = c$

The number of solution(s) (i.e., pair(s) $(x, y)$ that satisfy the equations) is

  1. $0$
  2. $1$
  3. $2$
  4. $3$

12 Answers

Best answer
52 52 votes
Consider each pair

1. $(a,a):$ $(a*a) +(a*a) = a+a = b   \neq c.$ So, $(a,a)$ is not possible

2. $(a,b):$ $(a*a) + (a*b) = a +b = a \neq c.$  So, $(a,b)$ is not possible

3. $(a,c):$ $(a*a)+(a*c) = a+c = c$

$\quad \quad \quad \quad (b*a) +(c*c) = b + b =b \neq c.$ So, $(a,c)$ is not possible

4. $(b,a):$ $(a*b) +(a*a) = b +a = a \neq c.$ So, $(b,a)$ is not possible

5. $(b,b):$ $(a*b) + (a*b) = b+b =b \neq c.$ So, $(b,b)$ is not possible

6. $(b,c):$ $(a*b) + (a*c) = b + c = c$

$\quad \quad \quad \quad (b*b) + (c*c) = c+b = c.$ So, $(b,c)$ is a solution

7. $(c,a):$ $(a*c) + (a*a) = c+a = a \neq c.$ So, $(c,a)$ is not possible

8.$(c,b):$ $(a*c) + (a*b) = c+b = c$

$\quad \quad \quad \quad (b*c) +(c*b) = a+c = c.$ So, $(c,b)$ is a solution

9. $(c,c):$ $(a*c) +(a*c) =c+c= b \neq c.$ So, $(c,c)$ is not possible

So, no. of possible solutions is $2$.

Correct Answer: $C$
• edited by
45 45 votes

We want $operand_1 + operand_2=c$ ,

so the pairs can be:
$(a, c)$
$(b, c)$
$(c, b)$

Now, note that identity element of $({a,b,c},*)$ is $\color{RED}{a}.$
So $(a∗x)+(a∗y)=c$ will result in the above 3 pair only.

No need to check equation 1, just see if these pairs satisfy $(b∗x)+(c∗y)=c.$
$(b, c)$ and $(c, b)$ satisfy equation 2 also so there are 2 solutions.

$C$ is the answer.

• edited by
3 3 votes

Approaching the problem the following way might speed you up : observe that the final sum required is $c$ and also the fact that $a*x = x, x\in a,b,c$. To get $c$ as the sum the only ways are: $$\begin{align} a+c &=c\\ b+c&=c\\ c+b&=c \end{align}$$

Now, to construct $a+c$ using the second equation $(b * x) + (c * y) = c $:
It can be: $(b*\color{blue}{c}=a) \color{red}{\wedge} ((c*\color{blue}{a}=c) \color{red}{\vee} (c*\color{blue}{b}=c))$.
Check $(c,a)$ and $(c,b)$ with the first equation: $(a * x) + (a * y) = c$ of which only $\color{red}{(c,b)}$ satisfies.

Similarly for $b+c$ we can have $(a,a)$ and $(a,b)$ which satisfy second equation of which neither satisfies first equation.

For $c+b$  we only have $(b,c)$ satisfying second equation and also $(a*b)+(a*c)=b+c=c$. Therefore $\color{red}{(b,c)}$ also satisfies first equation.

$\text{Hence, we only have two solutions } \color{red}{(c,b) \text{ and } (b,c)}$.

2 2 votes

Shortest approach, without any use of other identities/properties.

Only 3 equations can satisfy the given set of function, and they are as follows:

$a+c=c\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:-(i)$

$b+c=c\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:-(ii)$

$c+b=c\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:-(iii)$

Now $x$ can take only 3 values i.e. $a,b \: and \:  c$. Putting

$x=a$

a + __

b + __

can use only eqn $(i) \& (ii)$ 

But no value of $y$ will give us $c$ in both the equations.
$x=b$

b + __

c + __

can use only eqn $(ii) \& (iii)$

Putting y=c satisfies.

Therefore x=b and y=c is 1st solution

$x=c$

c+ __

b + __

can use only eqn $(ii) \& (iii)$

putting y=b satisfies.

Therefore x=c and y=b is 2nd solution

 

Therefore, option C.

Answer:
Position:
Show:

Related questions

61 61 votes
5 answers 5 answers
14.8k
14.8k views
Kathleen asked Sep 17, 2014
14,816 views
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
82 82 votes
8 answers 8 answers
21.2k
21.2k views
Kathleen asked Sep 16, 2014
21,182 views
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S \(\to\) {True, False} be a predicate defined on S. Suppose that P(...
46 46 votes
3 answers 3 answers
15.2k
15.2k views
Kathleen asked Sep 16, 2014
15,203 views
Consider the set $\Sigma^*$ of all strings over the alphabet $\Sigma = \{0, 1\}$. $\Sigma^*$ with the concatenation operator for stringsdoes not form a groupforms a non-c...
41 41 votes
5 answers 5 answers
11.1k
11.1k views
go_editor asked Feb 14, 2015
11,138 views
Let $\#$ be the binary operator defined as$X\#Y = X'+Y'$ where $X$ and $Y$ are Boolean variables.Consider the following two statements.$(S_1)$ $(P\#Q)\#R = P\#(Q\#R)$$(S_...