minor merger

2 files changed, 30 insertions, 2 deletions

diff --git a/model-un/research-guide.tex b/model-un/research-guide.tex
index 474fa94..0407ddf 100644
--- a/model-un/research-guide.tex
+++ b/model-un/research-guide.tex
@@ -1,5 +1,6 @@
 %%MUST convert nigeria-flag.svg to nigeria-flag.png
 \input color
+\input ulem.sty
 %%Should use phone-pdf?
 \let\ifphonepdf\iftrue
 
@@ -23,7 +24,6 @@
 \newfont{fourteenbf}=ptmb7t@14pt
 \fourteenbf
 
-\long\def\underbar#1{#1}
 %content-centred definitions
 \long\def\href#1#2{%visual, url
   \pdfstartlink
@@ -33,7 +33,7 @@
       /S /URI
       /URI (#2)
     >>}%
-    {\color{blue} \underbar{#1}}%
+    {\color{blue} \uline{#1}}%
   \pdfendlink
 }
 
diff --git a/tech-math/ws2.tex b/tech-math/ws2.tex
new file mode 100644
index 0000000..28c5da8
--- /dev/null
+++ b/tech-math/ws2.tex
@@ -0,0 +1,28 @@
+\input ws-form.tex
+
+{\bf \noindent\line{Math 3012-QHS \hfil Name: \rm \underline{Holden Rohrer}}
+Fall 2019\par\noindent
+Worksheet 2\par\noindent
+Due 09/10/2019}
+\smallskip \hrule \medskip
+
+\question{
+Q1 - Consider the set $X={1,2,3,4,5}$ and suppose you have two holes. Also suppose that you have 10 pigeons: the 2-element subsets of X. Can you put these 10 pigeons into the two holes in a way that there is no 3-element subset $S={a,b,c} \subset X$ for which all pigeons from $S$ go in the same hole? Then answer the same question if $X={1,2,3,4,5,6} with $15=C(6,2)$ pigeons.
+}{
+Each 3-element subset has 3 2-element subsets, so $m=3$. Treating the number of holes as $n$, we have greater than $mn+1=3\cdot 2+1=7$ pigeons, so there is no way to satisfy the condition. By the same calculus, a 6-element set cannot be organized in such a way to fulfil this condition.
+}\vfil
+\question{
+Q2 - Let $n = 10,000$. Suppose a friend tells you that he has a secret family of subsets of ${1,2,\dots,n}$, and if you guess it correctly, he will give you one million dollars. You think you know the family of subsets he has in mind and it contains exactly half the subsets, i.e., the family has $2^{n-1}$ subsets. Discuss how you can share your hunch with your friend in an effort to win the prize.
+}{
+Treating the family of all subsets as a set $S$, $S$ has $2^n$ members because any item can either be in or not in the subset.
+If my family of subsets were also treated as a set $P$, $P$ could be defined as $2^{10,000} \choose 2^{9,999}$ different families.
+Communicating such information would be impossible unless another symbolic definition could be derived.
+For example, $N = x \in S : 0 \notin x$ is easily communicable, as any set I have a hunch about would likely be, but most sets satisfying these solutions cannot---in general---be easily communicated.
+}\vfil\eject
+\question{
+
+}{
+
+}
+
+\bye