Question

In a Boolean Algebra $B$ , for all $x$ , $y$ in $B$ , $x\wedge \left(x\vee y\right)$ is equal to

• A. $y$
• B. $x$
• C. $1$
• D. $0$

Answer 1

Answer: (B)

$x\wedge (x\vee y)$
$=(x\wedge x)\vee (x\wedge y)$ 'by distribution law'
$=x\vee (x\wedge y)$ 'by idempotent law'
$=(x\vee f)$ 'by contradiction law'
$=x$