Monday, September 7, 2020

Algorithm Spotlight: Euclidean Algorithm

 The Euclidean algorithm is an algorithm for quickly finding the GCD (greatest common divisor) of two numbers and is an extremely important number theory concept. The GCD is used in many applications, like simplifying fractions, modular arithmetic, and also encryption algorithms such as the RSA Encryption Algorithm.


Review: Greatest Common Divisor (GCD)


Approach 1: Division

Finding the GCD of 105 and 72

Image for post
Image for post
Image for post
Image for post


Approach 2: Subtraction

Finding the GCD of 36 and 48

No comments:

How We Fix Misspelled Multilingual Queries with LLMs

  The rise of Large Language Models (LLMs) has generated significant excitement in the tech community. However, the real value lies in turni...