Skip to content

Commit

Permalink
fixed error in boolean function (CircuitVerse#344)
Browse files Browse the repository at this point in the history
  • Loading branch information
schezfaz authored and Dishebh committed May 23, 2020
1 parent fae4c83 commit 469816b
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions docs/nand_gate_method.md
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@ To simplify any given boolean expression, we must find the __minimum__ number of

Let's find the minimum number of NAND gates required to simplify the logical expression:
```yaml
F(A, B, C, D) = AB' + C'D + E
F(A, B, C, D) = AB' + C'D
```

### Step 1: Double Negation
Expand All @@ -38,7 +38,7 @@ Since the NAND gate is a combination of a NOT gate and an AND gate, we first app
Adding a double negation does not alter the inherent value of the expression as a double negation always nullifies itself.

```yaml
F = (F')' = ((AB' + C'D + E)')'
F = (F')' = ((AB' + C'D)')'
```

### Step 2: Applying De Morgan's Law
Expand Down

0 comments on commit 469816b

Please sign in to comment.