k-ary Almost Primes

        // the primes up to 100
        int primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,
                47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };

        // check every integer up to 100
        for (int i = 2; i <= 100; i++) {
            System.out.println("Testing " + i);
            int value = i;
            int factor = 0;
            int factorCount=0;
            // trying division by all primes
            for (int which = 0; which < primes.length; which++) {
                factor = primes[which];
                while (true) { // keep on dividing by this prime, if possible
                    int remainder = value % factor;
                    int quotient = value / factor;
                    if (remainder == 0) {
                        System.out.print(factor + " divides " + i + " . ");
                        factorCount++;
                        value = quotient;
                    } else
                        break; //no more divisions by this prime
                }
            }
            if (value == 1)
                System.out.println(i + " is " + factorCount + "-Almost Prime");

        }