Concrete Mathematics - Recurrent Problems - Warmups - (5)

最新推荐文章于 2014-10-11 20:24:00 发布

YenZiHua

最新推荐文章于 2014-10-11 20:24:00 发布

阅读量1.6k

点赞数

分类专栏：技能文章标签： Concrete Mathematics Knuth

本文链接：https://blog.csdn.net/YenZiHua/article/details/9200657

版权

技能专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Chapter One: Recurrent Problems

Warmups

5. A "Venn diagram" with three overlapping circles is often used to illustrate the eight possible subsets associated with three given sets. Can the sixteen possibilities that arise with four given sets be illustrated by four overlapping circles?

Well, this is also a recurrent problem. How many possible regions can we have at most by four overlapping circles? The answer is 14. Because when three circles overlap, it can make 8 regions at most. The three existing circles can cut the fourth circle into 6 arcs by overlapping at most, for each circle can cut a circle into 2 arcs at most. And each arc in the fourth circle can cut an existing region into two regions, so there would be 6 new regions by overlapping the fourth circle at most. Thus there would be 14 regions at most by four overlapping circles. But four given sets can generate 16 different sets, so there would be not enough regions such that one region corresponds to one set.