0) { $facttodo=str_replace('+',' ',urldecode($_GET['facttodo'])); } } else if (isset($_POST['facttodo'])) { if (strlen('' . $_POST['facttodo']) > 0) { $facttodo=str_replace('+',' ',urldecode($_POST['facttodo'])); } } if (isset($_GET['pow'])) { if (strlen('' . $_GET['pow']) > 0) { $pow=str_replace('+',' ',urldecode($_GET['pow'])); } } else if (isset($_POST['pow'])) { if (strlen('' . $_POST['pow']) > 0) { $pow=str_replace('+',' ',urldecode($_POST['pow'])); } } function fact($x) { $return = 1; for ($i=2; $i <= $x; $i++) { $return = gmp_mul($return, $i); } return $return; } function thepow($x, $y) { return gmp_pow($x, $y); } function thegcd($x, $y) { return gmp_gcd($x, $y); } function thelcm($x, $y) { return gmp_lcm($x, $y); } function nextprime($x) { return gmp_nextprime($x); } echo "

Factorials via GMP

RJM Programming - August, 2024

Factorial of
is ...

Number
to the power of
is ...

Next prime greater than
is ...

Least common multiple of
and
is ...

Greatest common divisor of
and
is ...

"; ?>