9. Lecture – 57: Properties of GCD and Bezout’s Theorem

In this lecture, we will discuss about the properties of GCD and we will also discuss about Bezout’s theorem.

In this introduction, the speaker sets the stage for the discussion about the GCD, which is short for Greatest Common Divisor, and Bezout's theorem. The GCD is the largest integer that can evenly divide two given numbers. Bezout's theorem states that the GCD can be expressed as a linear combination of these two numbers. This means that similar equations can be used to express the GCD.

Consider two friends, Alice and Bob, who have different numbers of apples. The GCD is like the largest group of apples they can evenly distribute among themselves, without leaving any leftover. Bezout's theorem tells us that we can find a way to mix their apples in different proportions to achieve that largest even distribution.

The theorem states that you can always express the GCD of two numbers as a linear combination of the two numbers itself.

Bezout's theorem is pivotal in number theory. It asserts that for any two integers, 'a' and 'b', if we determine their GCD, that GCD can be represented in the form of ax + by = GCD(a,b), where x and y are integers. This linear combination can include positive and negative integers.

Imagine you have two jars of different sizes. Each jar can be filled with a different number of marbles. Bezout's theorem is like saying, through clever planning, you can fill a smaller jar just using a certain count of marbles from the larger jars, ensuring that you use all the marbles without any leftovers.

If you take a = 6 and b = 14, the GCD is 2. It can be written as a linear combination with s = -2 and t = 1.

For the numbers 6 and 14, we find that GCD(6, 14) = 2. According to Bezout’s theorem, we can express 2 as -2(6) + 1(14). This means if you take -2 times 6 and add 1 time 14, you will get 2. This illustrates how various integers can work together in combinations to yield the GCD.

Think of a recipe where you need 2 units of sugar. You can substitute sugar with a mix of maple syrup and honey. Here, the numbers 6 and 14 represent different types of sweetness. Using the set ratios gives you just the right amount of sweetness without wasting any ingredients.

The proof of Bezout's theorem is non-constructive; it argues the existence of integers s and t without finding their exact values.

The proof starts by defining a set S, which consists of all possible integer linear combinations of 'a' and 'b'. The theorem's proof confirms that the GCD is an element of this set. The proof leverages claims about the properties of this set, including containing non-zero elements and how one can find the minimum element with the least absolute value. It concludes with s being a divisor of the GCD.

Imagine a puzzle where you must find a way to combine different shapes to create a perfect square. You know a perfect square exists through previous knowledge, but the exact shapes needed are not provided—you only know they exist amongst all the possible combinations.

The proof proceeds with a series of claims supporting the existence of integers s and t.

In the proof, various claims are established to confirm the properties of set S. One claim asserts that the GCD divides any element within S. A second claim demonstrates that within S exists an element s that divides the GCD of a and b, emphasizing that there are always integers within S that can express the GCD.

Consider organizing a book fair. You can think of the collection of books (set S) being some combinations of various genres—fiction, non-fiction—and the GCD represents the most popular genre that appeals to everyone. By showing that each genre can lead to this popular choice, we clarify how diverse combinations lead to the GCD.

Next, we want to find the specific integer combiners s and t using the Extended Euclid’s algorithm.

To find specific values of s and t (also known as Bezout's coefficients), we will use the Extended Euclid’s algorithm. This algorithm builds upon the basic Euclidean algorithm used to find the GCD, but it also tracks previous calculations to determine integer coefficients throughout the process. This way, by the end of the calculations, we can express the GCD as a linear combination of a and b.

Think of the Extended Euclid's algorithm like a lengthy recipe that not only tells you the end product (the GCD) but also provides detailed steps taken to ensure everything is blended perfectly. You keep notes after each step so that you can recreate the exact blending process to achieve that sweet or savory dish.

An integer b is the multiplicative inverse of another integer a modulo N if - a * b modulo N = 1.

The concept of a multiplicative inverse is crucial in modular arithmetic. If a and b are two integers, b is a multiplicative inverse of a modulo N if their product yields a result congruent to 1 under modulo N. Thus, they undo each other in regards to multiplication.

Imagine two currencies: every time you trade a certain amount of currency A for currency B, the two cancel each other out perfectly. This relationship where one acts effectively as the inverse of the other allows you to exchange them seamlessly, reflecting the idea of multiplicative inverses.

The multiplicative inverse of a exists if and only if a is co-prime to N.

This segment explains that for an integer a and a modulus N, the multiplicative inverse exists only when the GCD of a and N is 1, meaning they have no common divisors other than 1. If they share a common factor, a multiplicative inverse cannot exist because they fail to satisfy the modular conditions strictly.

It’s like finding a partner in a dance: if two people have similar dance styles (common factors), they might struggle to match perfectly and create synchronized rhythm (multiplicative inverse). Only if they have distinct and complementary styles, can they achieve a harmonious dance (existence of the inverse).

In this lecture, we saw the properties of the GCD and how we can express GCD of any two numbers as a linear combination.

In summary, we discussed the properties of the Greatest Common Divisor (GCD), demonstrated the significance of Bezout's theorem including finding integer combiners, and explored the concept of modular multiplicative inverses alongside the conditions for their existence.

Think of our lecture as a combination of essential ingredients for making a dish. Each concept (like GCD, Bezout's theorem, and multiplicative inverses) serves a critical role in cooking up a deeper understanding of number theory, much like how spices and ingredients blend together to create a delicious meal.

--