https://github.com/simon-isler/euclidean-algorithms

an efficient method for computing the greatest common divisor (GCD) of two integers
https://github.com/simon-isler/euclidean-algorithms

euclidean-algorithm maths zhaw

Last synced: 9 months ago
JSON representation

an efficient method for computing the greatest common divisor (GCD) of two integers

• Host: GitHub
• URL: https://github.com/simon-isler/euclidean-algorithms
• Owner: simon-isler
• Created: 2021-11-30T17:53:44.000Z (almost 4 years ago)
• Default Branch: main
• Last Pushed: 2021-12-04T11:17:12.000Z (almost 4 years ago)
• Last Synced: 2025-01-08T15:00:33.125Z (11 months ago)
• Topics: euclidean-algorithm, maths, zhaw
• Language: Python
• Homepage:
• Size: 2.93 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# euclidean-algorithms

an efficient method for computing the greatest common divisor (GCD) of two integers

## Sources

- https://www.geeksforgeeks.org/euclidean-algorithms-basic-and-extended/

- https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm

- https://brilliant.org/wiki/bezouts-identity/