Unrooted binary tree enumeration problem on unrooted binary trees is to count the number of trees with "n" labeled leaves and unlabeled internal nodes. An unrooted binary tree on "n" labeled leaves can be formed by connecting the "n"th leaf to a new node in the middle of any of the edges of an unrooted binary tree on "n" − 1 labeled leaves. There are 2"n" − 5 edges at which the "n"th node can be attached; therefore, the number of trees on "n" leaves is larger than the number of trees on "n" − 1 leaves by a factor of 2"n" −
Fat binary the data fork, in PEF format. Fat binaries were larger than programs supporting only the PowerPC or 68k, which led to the creation of a number of utilities that would strip out the unneeded version. In the era of small hard drives, when 80 MB hard drives were a common size, these utilities were sometimes useful, as program code was generally a large percentage of overall drive usage, and stripping the unneeded members of a fat binary would free up a significant amount of space on a hard drive. Fat binaries were a feature of NeXT's NeXTSTEP/OPENSTEP operating system, starting