Can someone explain to me this question in C

Question

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

Answer 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)