SOLUTION: Let a, b, n ∈ Z with n > 1. Prove that if a ≡ b (mod n) then 2a ≡ 2b (mod n)

SOLUTION: Let a, b, n ∈ Z with n > 1. Prove that if a ≡ b (mod n) then 2a ≡ 2b (mod n)

Algebra.Com

Question 1042856: Let a, b, n ∈ Z with n > 1. Prove that if a ≡ b (mod n) then 2a ≡ 2b (mod n)

Answer by jim_thompson5910(35256) (Show Source): You can put this solution on YOUR website!
a = b (mod n) is the same as saying a-b = k*n where k is some integer.

Multiply both sides of a-b = k*n by 2 to get 2a-2b = 2kn

2a-2b = 2kn can be then written in the form 2a = 2b (mod n). So that wraps up the proof.
RELATED QUESTIONS
a, b, n ∈ Z with n > 1. Prove that if a ≡ b (mod n) then 2a ≡ 2b (mod... (answered by rothauserc)

Let a, b, n ∈ N with n ≥ 2. If a^3 ≡ b^3 (mod n) then a ≡ b (mod... (answered by richard1234)

Modular arithmetic ... Find all possible replacements for n for which each congruence... (answered by stanbon)

Let A = {n C Z | n is odd} and B = {n C Z | n^2 - 1 mod 4}. Prove that A is included in... (answered by ikleyn)

Show that if am b, k and m are integers such that k≥1, m≥2, and a≡b(... (answered by rothauserc)

An integer n is called square-free if there does not exist a prime number p such that... (answered by richard1234)

(a) Let p be a prime number greater than 3. What are the possible remainders of p upon... (answered by jim_thompson5910)

not sure how to prove this? if n is odd then n^2 = 1 (mod 4)... (answered by math_tutor2020,ikleyn)

List all elements of the set A ∩ B, where A = {n ∈ N | n = 2^n − 1} and (answered by richard1234)