Checks to see if an integer has an integer root given an integer power

hasIntegerPower.php

<?php

function hasIntegerRoot($number, $power, &$root = null) {
    $root = round(pow($number, 1.0 / $power));
    return round(pow($root, $power)) == $number;
}

function testHasIntegerRoot()
{
    // calculate squares
    $number = 1;
    $last = 0;
    while ($last < 999) {
        $squares[] = $last = pow($number, 2);
        $number++;
    }

    // calculate cubes
    $number = 1;
    $last = 0;
    while ($last < 999) {
        $cubes[] = $last = pow($number, 3);
        $number++;
    }

    for ($i = 1; $i <= 999; $i++) {
        $isSquare = hasIntegerRoot($i, 2, $squareRoot);
        $isCube = hasIntegerRoot($i, 3, $cubeRoot);

        if ($isSquare && !in_array($i, $squares)) {
            echo "$i erroneously identified as perfect square.\n";
        }

        if ($isCube && !in_array($i, $cubes)) {
            echo "$i erroneously identified as perfect cube.\n";
        }

        if (!$isSquare && in_array($i, $squares)) {
            echo "$i erroneously not identified as perfect square.\n";
        }

        if (!$isCube && in_array($i, $cubes)) {
            echo "$i erroneously not identified as perfect cube.\n";
        }

        $numbers[$i] = array(
            'square' => $isSquare,
            'cube' => $isCube,
        );
    }
}