GCD.q {CryptRndTest} | R Documentation |
Greatest Common Divisor
Description
Finds the greatest common divisor (GCD) of two integers using the Euclidean algorithm. In addition to the value of GCD, it generates the number of required iterations to find GCD and the sequence of partial quotients.
Usage
GCD.q(x, y)
Arguments
x |
the first integer greater than zero. |
y |
the second integer greater than zero. |
Value
k |
the number of required iterations to find GCD. |
q |
the sequence of partial quotients. |
g |
the value of greatest common divisor. |
Author(s)
Haydar Demirhan
Maintainer: Haydar Demirhan <haydarde@hacettepe.edu.tr>
Examples
result=GCD.q(4535,2451)
print(result)
result=GCD.q(35,2)
print(result)
[Package CryptRndTest version 1.2.7 Index]