Show that for any k ≥ 2, if n + 1 distinct integers are chosenfrom the set [kn] = {1, 2, . . . , kn}, then there will be twointegers which differ by at most k − 1. Please demonstrate thesteps so that I can learn from it and solve other problems byfollowing the reasoning!
