-5

Been trying to figure out this stuff. This has to do with boolean algebra and is suing the C language. It has some algebra in it. Not sure how this works. Been trying to figure this out for half hour

Simplify the following Boolean expressions.

a.            F = A*B*C*D + A*B*C*D + A*B*C*D + A*B*C*D

b.            F = A*B*C + A*B*C + A*C*D + A*B*C*D
Progman
  • 16,827
  • 6
  • 33
  • 48
UI Developer
  • 167
  • 6
  • 16
  • 4
    This isn't a programming question, nor does it have anything to do with C. This is a logical operations question. – Thomas Jager Mar 14 '21 at 19:13
  • 4
    What does this boolean algebra question has to do with C and SO? – lnogueir Mar 14 '21 at 19:13
  • 3
    Please do not upload screenshots of the problem: https://meta.stackoverflow.com/questions/285551/why-not-upload-images-of-code-errors-when-asking-a-question – Bill Lynch Mar 14 '21 at 19:15
  • First create a new "variable" for `A AND B AND C AND D`, lets call it `X`. Then use that variable in the first expression, and you will have something like `X OR X OR X OR X`. Now how do you think that could be simplified? – Some programmer dude Mar 14 '21 at 19:18
  • I think that you should ask it in some boolean algebra forum. This is not a programming question. – ClaudioDeLise Mar 14 '21 at 19:29

1 Answers1

1

As in boolean algebra + is OR you can simplify it with:

F = A*B*C*D + A*B*C*D + A*B*C*D + A*B*C*D    (A v A) = A
  = A*B*C*D + A*B*C*D + A*B*C*D              (A v A) = A
  = A*B*C*D + A*B*C*D                        (A v A) = A
  = A*B*C*D                                  (A v A) = A   

F = A*B*C + A*B*C + A*C*D + A*B*C*D          (A v A) = A
  = A*B*C + A*C*D + A*B*C*D
  = A*B*C + A*C*D 
  = A*C*(B + D)
ClaudioDeLise
  • 247
  • 1
  • 9