`private static void testByFactoring() {

{

        primes: for (int ctr = 0; ctr < m_toFactor.length; ctr++) {

            int toTest = m_toFactor[ctr];

            for (int ctr2 = 0; ctr2 < m_divisors.length; ctr2++) {

                // max (int) Math.sqrt(m_numberToTest) + 1 iterations

                if (toTest != m_divisors[ctr2]
                        && toTest % m_divisors[ctr2] == 0) {
                    continue primes;
                }

            } // end of the divisor loop

        } // end of primes loop

    } // method`