amistre64
  • amistre64
Show that if a,b,c are integers; c>0; and a [congruent] b(mod m), then gcd(a,c) = gcd(b,c)
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
amistre64
  • amistre64
Heres what I was thinking ...
amistre64
  • amistre64
and its a = b (mod c) .. typoed it
amistre64
  • amistre64
since a = b (c); then a = b + ck, for some integer k a - b = ck ax1 + bx2 = ck ax1 + bx2 = c(y1+y2) ax1 + bx2 = cy1 + cy2 ax1 + cy1 = bx2 + cy2 ax1 + cy1 = g1, for some integer g g1 = bx2 + cy2 gcd(a,c) = gcd(b,c)

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
If a = b mod c then b = a + ck then gcd(b,c) = gcd(a+ck,c) = gcd(a,c) (I think)
anonymous
  • anonymous
That's true. You might want to give more reasoning though: Let d = gcd(b,c). Then, gcd(b,c) => b|d and c|d. => a+ck|d and c|d. Since c|d, ck|d. And, since ck|d, a+ck|d => a|d. And, then you're done. Easier to see this way, I think.
anonymous
  • anonymous
Oh, those arrows go both ways. It's an equality. Woops.
amistre64
  • amistre64
(b,c) = d therefore d|b and d|c there is some thrm that states that the gcd of 2 numbers can be written as a linear combination of those numbers d = bx + cy
anonymous
  • anonymous
Oh, I had it backwards. It works the same way, though.
anonymous
  • anonymous
I was relying on a theorem (or an extension of one, at least I think I was).
anonymous
  • anonymous
In fact this is an extension of gcd(m,n) = gcd(n,m%n)
amistre64
  • amistre64
id have to see a more detailed version of this: gcd(b,c) = gcd(a+ck,c)
anonymous
  • anonymous
k, a-b = ck like u have...
amistre64
  • amistre64
your just subing in b with a+ck ....
amistre64
  • amistre64
takes me a few times to read it right :)
anonymous
  • anonymous
Yes, relying on the theorem above....(so I guess what you want is a proof of that, in effect...
anonymous
  • anonymous
a-b = ck like u have Let gcd(a,c) = n -> n divdes a and c so a = nq and c = nr (some q and r)
anonymous
  • anonymous
Hope that's right (lots of letters to keep track of).
anonymous
  • anonymous
So a-b = ck -> nq - b = nrk -> b = n(q-rk) -> n divides b Do same for other side and it should drop out (I hope)
anonymous
  • anonymous
Found a prettier version of the whole thing.....
1 Attachment

Looking for something else?

Not the answer you are looking for? Search for more explanations.