Project Euler - Problem 5

euler.java

package euler;

public class Divisible {
	public static void main(String[] args) {
		for (long i = 0; i < Long.MAX_VALUE; i++) {
			if (isDivisible(i)) System.out.println(i);
		}
	}
	
	public static boolean isDivisible(long n) {
		for (int i = 1; i <= 20; i++) {
			if (n % i != 0) return false;
		}
		return true;
	}
}