Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Euler's GCD Algorithm Example #9

Open
ehildenb opened this issue Mar 29, 2018 · 0 comments
Open

Euler's GCD Algorithm Example #9

ehildenb opened this issue Mar 29, 2018 · 0 comments
Labels
enhancement

Comments

@ehildenb
Copy link
Member

Provide an example using Euler's GCD algorithm.

From @grosu:

function gcd(a, b)
    while b ≠ 0
       t := b; 
       b := a mod b; 
       a := t; 
    return a;
@ehildenb ehildenb changed the title Euler's GHD Algorithm Example Euler's GCD Algorithm Example Mar 29, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ehildenb