Let a, b be positive integers. Suppose that x, y are the smallest positive integers such that ax

Question

Madhur L · Answer

Hello everyone, in this question let us take a and b be non -zero integers as per the equation.

Vincenzo Zaccaro · Answer

Okay, so this is an easy application of Bezou theorem. This theorem tells us what? Tells us that

Madhur L · Answer

Hello students here in this question given if GCD of AB is equal to 1 then there exist integers

Sri K · Answer

So in this question, let x equals to gcd of a, b. So this will be equals to x complement a, x co

Adi S · Answer

Let GCD, e comma b equals D, then by the properties of GCD, GCD, GCD, A by D, comma, B by D equa

Let $a$, $b$ be positive integers. Suppose that $x$, $y$ are the smallest positive integers such that $ax - by = 0$. Prove that $x = \frac{b}{gcd(a, b)}$ and $y = \frac{a}{gcd(a, b)}$