On the reduction of irrelevance in Karnaugh Map Karnaugh map is shown in the figure. If the grid corresponding to the minimum terms M13, M15 and M11 is regarded as 1 according to the independent terms, the maximum bounding circle can be obtained, and L = D can be obtained. If the independent terms are not used, the maximum bounding circle can be obtained The answer is not the same at all. May I ask what kind of simplification method is right?

"The answer is not the same at all"
See this sentence, I think your digital teacher will spit blood and die

RELATED INFORMATIONS

1. Use Karnaugh map to simplify the following questions (1)Y（A,B,C）=∑m( 0,3,4,7 ) (2)Y（A,B,C）=∑m( 0,1,2,3,6,7 ) (3)Y（A,B,C,D）=∑m( 1,3,8,9,10,11,14,15 ) (4)Y（A,B,C,D）=∑m( 0,2,4,5,7,8 )+∑d(10,11,12,13,14,15)
2. How to simplify Karnaugh Map Using Karnaugh map to simplify y (a, B, C, d) = ∑ (0,2,6,7) + ∑ D (8,10,14,15)
3. Why can some squares be circled repeatedly when Karnaugh map is simplified?
4. Karnaugh map simplification To simplify the following logic functions, it is necessary to draw Karnaugh map and write the simplest and or expression F='(ABC)+A'BCD+A'B+A'BC+B'C This' (ABC) and a'B, like this one, don't all contain ABCD, how to draw a picture?
5. Karnaugh map simplification Q3\Q2 0 1 0 0 X 1 X 1^X Is it right to simplify Q2 + Q3 or Q2 or Q3, or take the simplest Q2 or Q3?
6. Simplifying y = ABCD + abd + BCD + ABC + BD + BC by algebraic method
7. (non-A + non-B + non-C) (a + B + C) reduction (Boolean algebra) How to simplify AD + BC not D + C (not a + not b) A non B non C + a non BC + AB non C + ABC + non a non BC + a non C
8. Please help simplify the value of Boolean algebra A + B + C. (B + D),
9. Who can help me to make this logic test simple? Y = a non B non CD + a non BC non D + a non BCD + AB non C non D + AB non CD + ABC non D + ABCD non + ABCD
10. Please help simplify the Boolean algebra formula (non-A + non-B + non-C) (a + B + C) Thank you first! I'm a freshman in senior high school. I don't understand terms
11. Using Karnaugh map to find the logic function f (a, B, C, d) = ∑ m (1,4,9,13) + ∑ D (5,6,7,11,15) Karnaugh map and simplification process, urgent
12. Are the expressions of logic functions simplified by theoretical calculation (Karnaugh map) or logic converter (EWB) in the same truth table the same? Why are they different?
13. Using Karnaugh map to simplify logic function y = a'b'c '+ a'b'c + a'bc + ab'c' requirement
14. Using Karnaugh map to simplify logic function f (a, B, C, d) = ∑ m (0,1,6,7,8,12,14,15)
15. Using Karnaugh map to simplify the following logic functions f (a, B, C, d) = ∑ m (15,13,10,6,4)
16. Using Karnaugh map to simplify logic function f (a, B, C,) = ∑ m (0,1,2,4,5,7)
17. Using Karnaugh map to simplify the following logic functions: Y (a, B, C, d) = ∑ m (2,3,5,7,8,9) + ∑ D (10,11,12,13,14,15)
18. Simplification of logic function f = (a, B, C, d) = ￡ m (0,1,6,7,8,12,14,15) Karnaugh map method
19. Using Karnaugh map, the following logic function y2 = (ab '+ b) CD' + ((a + b) (B '+ C))' is reduced to the simplest and or form,
20. Using Karnaugh map to change the logic function y = C + ABC into the simplest and or expression