Solution to Project Euler Problem 52: Permuted multiples - It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order. Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.

• Java Code

package sikademy;
/**
 *
 * @author Archangel Macsika
 * Copyright (c) Sikademy. All rights reserved
 */

import java.util.Arrays;

public class SikademyEulerSolution {
	
	public String run() {
		for (int i = 1; ; i++) {
			if (i > Integer.MAX_VALUE / 6)
				throw new ArithmeticException("Overflow");
			if (multiplesHaveSameDigits(i))
				return Integer.toString(i);
		}
	}
	
	
	private static boolean multiplesHaveSameDigits(int x) {
		for (int i = 2; i <= 6; i++) {
			if (!Arrays.equals(toSortedDigits(x), toSortedDigits(i * x)))
				return false;
		}
		return true;
	}
	
	
	private static char[] toSortedDigits(int x) {
		char[] result = Integer.toString(x).toCharArray();
		Arrays.sort(result);
		return result;
	}
	


	public static void main(String[] args) {
                SikademyEulerSolution solution = new SikademyEulerSolution();
		System.out.println(solution.run());
	}	
}

• Python Code

# 
# @author Archangel Macsika
# Copyright (c) Sikademy. All rights reserved.
# 

import itertools

def compute():
	cond = lambda i: all(sorted(str(i)) == sorted(str(j * i)) for j in range(2, 7))
	ans = next(i for i in itertools.count(1) if cond(i))
	return str(ans)


if __name__ == "__main__":
	print(compute())