it's not a jawbreaker, it's impossible IMO.The following is a section of PHP code (see Apache.org and PHP.net).
function f($c) {
$c++;
if ($c % 2) { return f($c); }
return $c++;
}
function g($n) { for ($i=1;$i<10;$i++) {
$n = f($n*$i);
}
return ($n);
}
print(g($x));
What is the smallest value that $x can have if 4277108 is outputted to the screen after running this code? $x is a number between 1 and 10 and has 2 decimal places.
f() always returns the number if it's uneven, or if it's even, it returns (n+1). So, it always returns uneven. which means the result of g() can *never* be even.
[[side note:
unless "return $c++;" does first add 1 to it before returning, but I think it doesn't, since it's a postincrement operator.
]]
-- PHP Windows Mailing List (http://www.php.net/) To unsubscribe, visit: http://www.php.net/unsub.php