Sr Examen

Expresión dand(NOTaOR(bANDa))

El profesor se sorprenderá mucho al ver tu solución correcta😉

    Solución

    Ha introducido [src]
    d∧((¬a)∨(a∧b))
    $$d \wedge \left(\left(a \wedge b\right) \vee \neg a\right)$$
    Solución detallada
    $$\left(a \wedge b\right) \vee \neg a = b \vee \neg a$$
    $$d \wedge \left(\left(a \wedge b\right) \vee \neg a\right) = d \wedge \left(b \vee \neg a\right)$$
    Simplificación [src]
    $$d \wedge \left(b \vee \neg a\right)$$
    d∧(b∨(¬a))
    Tabla de verdad
    +---+---+---+--------+
    | a | b | d | result |
    +===+===+===+========+
    | 0 | 0 | 0 | 0      |
    +---+---+---+--------+
    | 0 | 0 | 1 | 1      |
    +---+---+---+--------+
    | 0 | 1 | 0 | 0      |
    +---+---+---+--------+
    | 0 | 1 | 1 | 1      |
    +---+---+---+--------+
    | 1 | 0 | 0 | 0      |
    +---+---+---+--------+
    | 1 | 0 | 1 | 0      |
    +---+---+---+--------+
    | 1 | 1 | 0 | 0      |
    +---+---+---+--------+
    | 1 | 1 | 1 | 1      |
    +---+---+---+--------+
    FND [src]
    $$\left(b \wedge d\right) \vee \left(d \wedge \neg a\right)$$
    (b∧d)∨(d∧(¬a))
    FNDP [src]
    $$\left(b \wedge d\right) \vee \left(d \wedge \neg a\right)$$
    (b∧d)∨(d∧(¬a))
    FNCD [src]
    $$d \wedge \left(b \vee \neg a\right)$$
    d∧(b∨(¬a))
    FNC [src]
    Ya está reducido a FNC
    $$d \wedge \left(b \vee \neg a\right)$$
    d∧(b∨(¬a))