The Easiest Problem

This is probably the easiest task of this problem set. To help you understand the task let us define two key functions: f(n,k), (with k ) which gives the number of ways we can draw a sample of k objects from a set of n-distinct objects where order of drawing is not important and we do not allow repetition. G(x1, x2, x3, ... , xn) is the largest integer that perfectly divides all of  {x1, x2, x3,