★ wanayoo — archive 1999 http://fr.php.net/manual/function.gmp-gcdext.phpNouvelle recherche | Portail wanayoo

PHP Home Page
Manual Table of Contents
Up to GMP
Quick Reference
English version of this pageGerman version of this pageJapanese version of this page
Italian version of this pageFrench version of this pageHungarian version of this page
Spanish version of this pageDutch version of this pageBrazilian Portuguese version of this page
Korean version of this pageCzech version of this page
GMP
* gmp_init
* gmp_intval
* gmp_strval
* gmp_add
* gmp_sub
* gmp_mul
* gmp_div_q
* gmp_div_r
* gmp_div_qr
* gmp_div
* gmp_mod
* gmp_divexact
* gmp_cmp
* gmp_neg
* gmp_abs
* gmp_sign
* gmp_fact
* gmp_sqrt
* gmp_sqrtrm
* gmp_perfect_square
* gmp_pow
* gmp_powm
* gmp_prob_prime
* gmp_gcd
* gmp_gcdext
* gmp_invert
* gmp_legendre
* gmp_jacobi
* gmp_random
* gmp_and
* gmp_or
* gmp_xor
* gmp_setbit
* gmp_clrbit
* gmp_scan0
* gmp_scan1
* gmp_popcount
* gmp_hamdist

  Thanks to:
 Chek.com
 easyDNS
 VA Linux Systems

  Related sites:
Apache
MySQL
PostgreSQL
Zend Tech.

  Community:
LinuxFund.org
OSDN
Manual: gmp_gcdext
 View the source code for this pageSearch the site



Previous page
  gmp_gcd
  Updated
Mon, 08 Jan 2001
 gmp_invert 
 Next page

gmp_gcdext

(unknown)

gmp_gcdext -- Calculate GCD and multipliers

Description

array gmp_gcdext (resource a, resource b)

Calculates g, s, and t, such that a*s + b*t = g = gcd(a,b), where gcd is the greatest common divisor. Returns an array with respective elements g, s and t.


 About Notes

Previous page
  gmp_gcd
  Updated
Mon, 08 Jan 2001
 gmp_invert 
 Next page




Who's responsible for this?
Top of this page
Site
Hosting:

Located in
France
Elements of this website are subject to copyright.
Questions about installing or using PHP should be directed to one of the mailing lists.
Only questions about the website should be directed to webmaster@php.net.