Differences

This shows you the differences between two versions of the page.

--- pow:problem2s26 [2026/02/24 03:37] – created mazur
+++ pow:problem2s26 [2026/08/06 17:36] (current) – jlasseter
@@ Line 1: / Line 1: @@
 <box 85% round orange|  Problem 2 (due Monday, February 23 ) >
-In a class with $n>2$ students the teacher wants to assign to each student some topics to work on in such a way that any two students have a unique common topic assigned, each topic is given to more than one student
+In a class with \(n>2\) students the teacher wants to assign to each student some topics to work on in such a way that any two students have a unique common topic assigned, each topic is given to more than one student
-but no topic is assigned to all the students. Show that the teacher has to use at least $n$ topics.
+but no topic is assigned to all the students. Show that the teacher has to use at least \(n\) topics.
 </box>
+We received a solution from Prof. Emmett Wyman. His solution is very elegant and different from our in-house solution.
+For details and more information about the problem and a related open question see the following link
+{{:pow:2026sproblem2.pdf|Solution}}.