gcd

Compute the greatest common divisor

static if(BOTAN_HAS_PUBLIC_KEY_CRYPTO)

gcd

(

const(BigInt)* a

,

const(BigInt)* b

)

Parameters

a const(BigInt)*: positive integer x
b const(BigInt)*: positive integer y

Return Value

Type: BigInt

gcd(x,y)

Meta

Source

See Implementation