论文部分内容阅读
大家知道,求集合的交集、并集、补集,有时画韦恩图很方便,对数集来说,“有时”,其实就是“求离散数集的交、并、补时”. 若要“求连续数集的交、并、补”,则画韦恩图并不方便. 在多年的教学实践中,我发现了一个可以很方便地求出连续数集的交、并、补的方法-“搭棚子”法.你想学吗? 例1 已知全集I=[1,6」,集合A=[2,4],集合B=[3,5].求A∩B,A∪B,A,B,A∩B,A∪B.
Everyone knows that it is very convenient to draw a set of intersections, unions, and complements. It is sometimes convenient to draw a Wayn diagram. For a logarithmic set, “sometimes” actually means “to find, pay, and complement a discrete set of numbers.” “To find the intersection, union, and complement of consecutive numbers,” it is not convenient to draw the Wayne diagram. In years of teaching practice, I have found a method that can easily find the intersection, union, and complement of consecutive numbers. - “Shack” method. Do you want to learn? Example 1 Known universal set I=[1,6], set A=[2,4], set B=[3,5]. Ask A∩B, A∪ B, A, B, A∩B, A∪B.