A restaurant chef has designed a new set of dishes for his menu. His set of dishes contains 10 10 main courses, and he will sele
ct a subset of them to place on the menu each night. To ensure variety of main courses for his patrons, he wants to guarantee that a night's menu is neither completely contained in nor completely contains another night's menu. What is the largest number of menus he can plan using his 10 10 main courses subject to this requirement
Quadratic equations of the form (x - h)^2 + k = 0 can be solved using square roots: Take the square root of both sides, prefacing the right side with " ± "
