In this problem we are looking for the smallest integer, n, that contains the same digits as 2n, 3n, 4n, 5n and 6n. I did a dumb, brute force solution that takes each integer in turn, creates a sets that contain the digits of each of the multiples and checks to see if they are all the same. When checking the equality of sets, the order of the elements doesn't matter. The set (a,b,c) is the same as the set (c,a,b).