Project euler problem 7 - take 1

scratch_7.java

import java.math.BigInteger;
import java.util.ArrayList;
import java.util.List;

class Scratch {
    public static void main(String[] args) {
        System.out.println(solution());
    }

    private static int solution() {
        List<Integer> primes = new ArrayList<>();
        int start = 2;
        while (primes.size() <= 10001) {
            BigInteger bigIntValue = BigInteger.valueOf(start);
            if (bigIntValue.isProbablePrime(5)) {
                primes.add(start);
            }
            start++;
        }
        return primes.get(10001);
    }

}