Haha true. Let N be the set of all nuts, and let
C : N → P(P(N)) be the function for cracking a nut, where P(N) is the power set of N. Then, For every nut n in N, if n is cracked via C(n)), the cardinality of the resulting set of nutshells |C(n)| > 2.
Mathematical Definition of Nut Cracking Using Set Theory
By
–
Leave a Reply