Question: Assignment Problem 5. (a) Prove the theorem using combinatorial proof. Hint: Count the number of pairs of (points and blocks) in two different ways for

Assignment Problem 5. (a) Prove the theorem using combinatorial proof. Hint: Count the number of pairs of (points and blocks) in two different ways for the first, and for the second fix a point p' and count the number of points in the same blocks as p' in two different ways. (b) How does this theorem imply that for a Steiner Triple System of order v we need to have v = 1,3 (mod 6)? Assignment Problem 5. (a) Prove the theorem using combinatorial proof. Hint: Count the number of pairs of (points and blocks) in two different ways for the first, and for the second fix a point p' and count the number of points in the same blocks as p' in two different ways. (b) How does this theorem imply that for a Steiner Triple System of order v we need to have v = 1,3 (mod 6)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
