gmp_gcdext
Description
The gmp_gcdext of GMP for PHP calculates the greatest common divisor (GCD) and multipliers.
Syntax
gmp_gcdext( GMP|int|string $num1, GMP|int|string $num2 ): array
Parameters
num1
A GMP object, an int or a numeric string.
num2
A GMP object, an int or a numeric string.
Return
Returns an array of GMP objects.
gcd(a,b) = g = a*s + b*t
Examples
1 · num1 num2 · GMP
<? $num1 = -6; $num2 = 9; $num1 = gmp_init($num1); $num2 = gmp_init($num2); $return = gmp_gcdext($num1, $num2); var_dump($return);
array(3) { ["g"]=> object(GMP)#3 (1) { ["num"]=> string(1) "3" } ["s"]=> object(GMP)#4 (1) { ["num"]=> string(1) "1" } ["t"]=> object(GMP)#5 (1) { ["num"]=> string(1) "1" } }
2 · num1 num2 · int
<? $num1 = -6; $num2 = 9; $return = gmp_gcdext($num1, $num2); var_dump($return);
array(3) { ["g"]=> object(GMP)#1 (1) { ["num"]=> string(1) "3" } ["s"]=> object(GMP)#2 (1) { ["num"]=> string(1) "1" } ["t"]=> object(GMP)#3 (1) { ["num"]=> string(1) "1" } }
3 · num1 num2 · string
<? $num1 = "-6"; $num2 = "9"; $return = gmp_gcdext($num1, $num2); var_dump($return);
array(3) { ["g"]=> object(GMP)#1 (1) { ["num"]=> string(1) "3" } ["s"]=> object(GMP)#2 (1) { ["num"]=> string(1) "1" } ["t"]=> object(GMP)#3 (1) { ["num"]=> string(1) "1" } }
Links
Related
GMP
- gmp_abs
- gmp_add
- gmp_and
- gmp_binomial
- gmp_clrbit
- gmp_cmp
- gmp_com
- gmp_div
- gmp_div_q
- gmp_div_qr
- gmp_div_r
- gmp_divexact
- gmp_export
- gmp_fact
- gmp_gcd
- gmp_hamdist
- gmp_import
- gmp_init
- gmp_intval
- gmp_invert
- gmp_jacobi
- gmp_kronecker
- gmp_lcm
- gmp_legendre
- gmp_mod
- gmp_mul
- gmp_neg
- gmp_nextprime
- gmp_or
- gmp_perfect_power
- gmp_perfect_square
- gmp_popcount
- gmp_pow
- gmp_powm
- gmp_prob_prime
- gmp_random_bits
- gmp_random_range
- gmp_random_seed
- gmp_root
- gmp_rootrem
- gmp_scan0
- gmp_scan1
- gmp_setbit
- gmp_sign
- gmp_sqrt
- gmp_sqrtrem
- gmp_strval
- gmp_sub
- gmp_testbit
- gmp_xor