Project Euler Smallest multiple

Project-Euler-5.java

package euler;

/**
 * @author i88.ca
 * 
 */
public class P5 {
	// refers to overview in project Euler.
	public static void main(String[] args) {
		int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19 };
		int[] a = new int[primes.length];
		int result = 1;
		int limit = (int) Math.sqrt(20);
		for (int i = 0; i < a.length; i++) {
			if (i <= limit) {
				a[i] = (int) Math.floor(Math.log(20) / Math.log(primes[i]));
			} else {
				a[i] = 1;
			}
			System.out.println(a[i]);
			result *= Math.pow(primes[i], a[i]);
		}
		System.out.println(result);
	}
}