Can Bezout's Theorem Prove Coprime Relationship in Modular Arithmetic?

twodice · Nov 19, 2009

what is it?

twodice · Nov 19, 2009

what I am trying to prove is that given the d=gdf(a,b) and ax+by=d prove that x and y are coprime or i guess (x,y)=1

i don't know whether or not to use modular arithmetic.

ramsey2879 · Nov 20, 2009

twodice said:

what I am trying to prove is that given the d=gdf(a,b) and ax+by=d prove that x and y are coprime or i guess (x,y)=1

i don't know whether or not to use modular arithmetic.

Hint write a and b as two parts each with one part being "gdf(a,b)" What happens to the "gdf" if (x,y) > 1

Can Bezout's Theorem Prove Coprime Relationship in Modular Arithmetic?

Thread 'About the existence of Hamel basis for vector spaces'

Similar threads

Hot Threads

I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?

I Showing ##k[x_1,\ldots,x_n]/\mathfrak{a}## is finite dimensional

A Near-Rings with Noncommutative Addition and Two-Sided Distributivity

I How do we distinguish two different notations for cokernel and coimage?

I Localising a non integral domain at a prime

Recent Insights

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Insights What Exactly is Dirac’s Delta Function? - Insight

Insights Relativator (Circular Slide-Rule): Simulated with Desmos - Insight

Insights Fixing Things Which Can Go Wrong With Complex Numbers

Insights Fermat's Last Theorem