My Math Forum Induction question about partitioning with a condition

 Probability and Statistics Basic Probability and Statistics Math Forum

 April 20th, 2019, 11:32 PM #1 Newbie   Joined: Apr 2019 From: IRI Posts: 1 Thanks: 0 Induction question about partitioning with a condition We have $\displaystyle n$ students which are in $\displaystyle k$ classes. We know that between each two classes, there exist two persons A and B who know each other. Prove that we can put students in $\displaystyle n−k+1$ groups such that all the persons in a group know each other. (the proof is probably with induction) (I think it is safe to assume none of $\displaystyle k$ classes will be empty) I don't know how should I approach this question. Should I use induction on n or $\displaystyle k$? how?

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post zzzhhh Calculus 4 August 6th, 2017 03:35 AM Mahonroy Applied Math 1 November 5th, 2009 01:37 PM transgalactic Calculus 0 November 28th, 2008 07:09 AM homiee Calculus 4 November 10th, 2008 01:53 PM sastra81 Abstract Algebra 0 January 7th, 2007 07:34 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top