funky medina: Good to see you active on the forum.

Z8: //first number
$number = array($i,$j,)
//Determine the lowest of the numbers
asort($number);
//Lowest of the numbers
$lower_limit = $number[0];
//get all the factors of all the numbers,
For($g=0; $g<=$lower_limit; $g++){
For($h=0;$h<=count($number)-1;$h++){
If(fmod($number[$h],$g) == 0){
$factors[$number[$h]][] = $number[$h]/$g;
}
}
}
// all common factors
$c_factor = array_intersect($factors[0],$factors[1]);
//highest common factor
$g_c_factor = max($c_factor);

echo $g_c_factor;

  function phpChallenge($int1,$int2){
  $bool = true;
     while($bool){
      if($int1 == $int2) return $int2;
          ($int1 > $int2 ? $int1 -=$int2 : $int2 -= $int1);
      }
}

time: 0.01s memory: 20520 kB

Z8:


ideone.com/wjMeL2
That's the link in the site ran in 0.01 seconds but can't see the output to confirm its error free. Though am sure its good

Judinho59: http://ideone.com/vyBw4v

  function phpChallenge($int1,$int2){
  $bool = true;
     while($bool){
      if($int1 == $int2) return $int2;
          ($int1 > $int2 ? $int1 -=$int2 : $int2 -= $int1);
      }
}

function phpChallenge($int1, $int2){
 while($int2 != 0){
$rem = $int1 % $int2;
$int1 = $int2;
$int2 = $rem;
}
 return (empty($int1) ? '1' : $int1);
}

elvis10ten: Where is your <?php and ?>. I didn't really look at your code tho, i just noticed those at first. Please correct and try again

Z8:

Haha u right taken for granted...please ignore the mistake and check if the code is valid

Z8: ideone.com/tHKAbQ