From 24bd47b996d5565dbbc0192dd1fb6f1e6f11ed73 Mon Sep 17 00:00:00 2001
From: Holden Rohrer <hr@hrhr.dev>
Date: Sat, 18 Apr 2020 02:07:15 -0400
Subject: cleaned up with the help of a makefile

---
 tech-math/comb/hw3.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'tech-math/comb/hw3.tex')

diff --git a/tech-math/comb/hw3.tex b/tech-math/comb/hw3.tex
index 8880ff8..27a0b24 100644
--- a/tech-math/comb/hw3.tex
+++ b/tech-math/comb/hw3.tex
@@ -60,7 +60,7 @@ Q6 (6.8) -- For this exercise, considef the poset $\bf P$ in Figure 6.5 (not pic
 \question{%
 Q7 (6.9) -- Find the height $h$ of the poset ${\bf P} = (X, P)$ shown below as well as a maximum chain and a partition of $X$ into $h$ antichains using the algorithm from this chapter.
 }{
-Partition: $(23,12,22,18) \cup () \cup ()
+Partition: $(23,12,22,18) \cup () \cup ()$
 }
 \question{%
 Q8 (6.11) -- A restaurant chef has designed a new set of dishes for his menu. His set of dishes contains 10 main courses, and he will select 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 main courses subject to this requirement?
-- 
cgit 

