Gary2005's blog

Help with math!
By Gary2005, history, 5 years ago, In English

if integers A and B satisfy gcd(A,B)=1,why there are always two integers x and y that x*A-y*B=1?

  • Vote: I like it
  • +8
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

check extended euclidian algorithm. Because this algorithm works you can see that this statement is always true

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Also it can be proved by euler theorem

    → Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +6 Vote: I do not like it
Proof not relying on Euclidean algorithm
→ Reply
»
5 years ago, # |
  Vote: I like it +11 Vote: I do not like it

Well, it's Bézout's identity。 You can search it on the Internet.

→ Reply