Re: HSC 2015 4U Marathon
\\ $Let$ \ S(n,k) \ $be the number of ways to divide the collection of numbers$ \ \{1,2,3,\dots,n \} \ $into$ \ k \ $non-empty groups$
\\ $e.g.$ \ S(3,2) = 3 \ $since one can divide$ \ (A,B,C) \ $into groups$ \ (AB, C) , (AC, B) \ $and$ \ (BC, A)
\\ $By considering...