If d = gcd(a, m) and d|c, then show that the congruence ax ≡ c (mod m) is equivalent to a x≡c (modm).
up vote
0
down vote
favorite
If $d = gcd(a, m)$ and $d|c$, then show that the congruence $ax equiv c$ (mod $m$) is equivalent to
$$frac{a}{d} x equiv frac{c}{d} mod frac{m}{d} .$$
proof-writing modular-arithmetic congruence-relations
edited Nov 14 at 16:04
Davide Giraudo
123k16149253
asked Nov 14 at 15:58
N.Luscomb
1
add a comment |
up vote
0
down vote
favorite
If $d = gcd(a, m)$ and $d|c$, then show that the congruence $ax equiv c$ (mod $m$) is equivalent to
$$frac{a}{d} x equiv frac{c}{d} mod frac{m}{d} .$$
proof-writing modular-arithmetic congruence-relations
edited Nov 14 at 16:04
Davide Giraudo
123k16149253
asked Nov 14 at 15:58
N.Luscomb
1
The titled question differs from that in the body. Please correct.
– Bill Dubuque
Nov 14 at 16:14
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
If $d = gcd(a, m)$ and $d|c$, then show that the congruence $ax equiv c$ (mod $m$) is equivalent to
$$frac{a}{d} x equiv frac{c}{d} mod frac{m}{d} .$$
proof-writing modular-arithmetic congruence-relations
edited Nov 14 at 16:04
Davide Giraudo
123k16149253
asked Nov 14 at 15:58
N.Luscomb
1
If $d = gcd(a, m)$ and $d|c$, then show that the congruence $ax equiv c$ (mod $m$) is equivalent to
$$frac{a}{d} x equiv frac{c}{d} mod frac{m}{d} .$$
proof-writing modular-arithmetic congruence-relations
proof-writing modular-arithmetic congruence-relations
edited Nov 14 at 16:04
Davide Giraudo
123k16149253
asked Nov 14 at 15:58
N.Luscomb
1
edited Nov 14 at 16:04
Davide Giraudo
123k16149253
asked Nov 14 at 15:58
N.Luscomb
1
edited Nov 14 at 16:04
Davide Giraudo
123k16149253
edited Nov 14 at 16:04
Davide Giraudo
123k16149253
edited Nov 14 at 16:04
Davide Giraudo
123k16149253
123k16149253
asked Nov 14 at 15:58
N.Luscomb
1
asked Nov 14 at 15:58
N.Luscomb
1
asked Nov 14 at 15:58
N.Luscomb
1
1
The titled question differs from that in the body. Please correct.
– Bill Dubuque
Nov 14 at 16:14
add a comment |
The titled question differs from that in the body. Please correct.
– Bill Dubuque
Nov 14 at 16:14
The titled question differs from that in the body. Please correct.
– Bill Dubuque
Nov 14 at 16:14
The titled question differs from that in the body. Please correct.
– Bill Dubuque
Nov 14 at 16:14
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2998426%2fif-d-gcda-m-and-dc-then-show-that-the-congruence-ax-%25e2%2589%25a1-c-mod-m-is-equiva%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
The titled question differs from that in the body. Please correct.
– Bill Dubuque
Nov 14 at 16:14