MCPcopy Create free account
hub / github.com/TheAlgorithms/C-Plus-Plus / gcdExtended

Function gcdExtended

math/ncr_modulo_p.cpp:44–58  ·  view source on GitHub ↗

* @brief finds the values x and y such that a*x + b*y = gcd(a,b) * * @param[in] a the first input of the gcd * @param[in] a the second input of the gcd * @param[out] x the Bézout coefficient of a * @param[out] y the Bézout coefficient of b * @return the gcd of a and b */

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

modInverseFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected