public static void main(String[] args) {
        //first, let's populate the list of primes.
        int a = 0, b = 2;
        
        while (a < 1000) {
            if (isPrime(b))
                some_primes[a++] = b;
            b++;
        }
        
        // -------------------------------------- //
        
        double noverphi = 0;
        int n = 0;
        
        for (int i = 2; i < 1000000; i++) {
            //System.out.println(i);
            double phi = phi(i);
            
            if (noverphi < i / phi) {
                System.out.println("new n @ " + i);
                n = i;
                noverphi = i / phi;
            }
        }
        
        System.out.println("final n: " + n);
    }