Answer:
As per the question, we need to convert product of sum into sum of product,
Given:
(A' +B+C')(A'+C'+D)(B'+D'),
At first, we will solve to parenthesis,
= (A'+C'+BD) (B'+D')
As per the Rule, (A+B)(A+C) = A+BC, In our case if we assume X = A'+C', then,
(A' +B+C')(A'+C'+D) = (A'+C'+B)(A'+C'+D) = (A'+C'+BD)
Now,
= (A'+C'+BD) (B'+D') = A'B' + A'D' + C'B' +C'D' +BDB' +BDD"
As we know that AA' = 0, it mean
=A'B'+A'D'+C'B'+C'D'+D*0+B0
=A'B'+A'D'+C'B'+C'D' as B * 0 and D*0 = 0
Finally, minimum sum of product boolean expression is
A''B'+A'D'+C'B'+C'D'
=
Answer:
Step-by-step explanation:
2) Take the number you see (7). How many 7s are there? There are three.
7 x 3
3) What number do you see? 3. How many 3s? Five 3s.
3 x 5
Now you try
Answer:
B) 504
Step-by-step explanation:
They should expect 30% of 40 out of every 300 of the 12,600, so ...
0.30 × 40/300 × 12,600 = 504
About 504 residents might be expected to join.
we'll do the same as before, turning the mixed fractions to improper and do the division, keeping in mind that is simply asking how many times 1⅕ goes into 8⅔.
Answer:
2325
Step-by-step explanation:
Kkkkkkkkjajahaaj