| [ QuizWit ] in KIDS 글 쓴 이(By): iLUSiON (redemption) 날 짜 (Date): 1998년 4월 26일 일요일 오전 09시 08분 17초 제 목(Title): ans: computational math. i think you can prove by induction! i am not so sure if this will hold if we includes some pathological example in measure theory. since C is always convexhull(A U B) you can always partition C in such a way that C will be a partition of n convexhulls adjacent to each other. since you can prove the case when there are 2 adjacent convexhulls, it follows by induction on n. warning: you may have to consider when A or B is not convex. but i believe this case can be incoporated into my induction proof with minor adjustment. Question: What is Gabi's law ? Can you kindly state the theorem. I would be very happy to know something new. ^^ 1010101010101010101010101000000010101010010101010101000000010001111110101001010 0101010011111010101000100010110101010101010101001010101010101010101111111101010 1011111100010101010101010101101010101011111101010111101010001110101010001010110 http://www.math.mcgill.ca/~chung |