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

  • Context: Undergrad 
  • Thread starter Thread starter twodice
  • Start date Start date
  • Tags Tags
    Theorem
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
Sign up Log in
2 replies · 3K views
twodice
Messages
2
Reaction score
0
what is it?
 

Discussion

Physics news on Phys.org
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.
 
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
 

Similar threads

Does Bezout's theorem work both ways?

  • Heisenberg7
  • · Replies 6 ·
  • Calculus and Beyond Homework Help
Replies
6

High School Proof of a lemma of BÉZOUT’S THEOREM

  • SamitC
  • · Replies 2 ·
  • General Math
Replies
2

Graduate How Can We Prove the Extension of Bezout's Identity?

  • Onias
  • · Replies 13 ·
  • Linear and Abstract Algebra
Replies
13