SOLUTION: Prove or disprove: There exists an integer a for which 20a ≡ 2 mod 8.

Question 1178231: Prove or disprove: There exists an integer a for which 20a ≡ 2 mod 8.
Answer by ikleyn(52778) (Show Source): You can put this solution on YOUR website!
.


Let "a" be such an integer number that  20a ≡ 2 (mod 8)


It means that  20a - 2 is divisible by 8:  


      20a-2 = 8m  for some integer m      (1)


Divide by 2 both sides of equation  (1).  You will get then


    10a - 1 = 4m.


But it is just a contradiction:  10a is a multiple of 2;  4m  is a multiple of 2;

hence, their difference 1 = 10a - 4m  must be multiple of 2, but it is not the case.


The contradiction proves that 20a ≡ 2 mod 8 is not possible.

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

Prove that there exists some integer n such that n^2 + 123457 is a perfect... (answered by Edwin McCravy)

Prove or disprove the following: The expression n2 � n +41 produces a prime number for... (answered by richard1234)

Prove (disprove) that there exists an A and B such that logA(B) = logB(A) where A... (answered by Edwin McCravy)

Prove or disprove: i divides n^3(in otherwords n^3/i is an integer), then i divides... (answered by richard1234)

) Prove that for any positive integers a and b, gcd(a,b) · lcm(a,b) = a·b. b) If the... (answered by Shin123)

Prove or disprove the product of a rational and an irrational is... (answered by richard1234)

prove or disprove without a calculator. 1. sin(pi/2 + theta) = cos theta (answered by solver91311)

Prove or disprove that Segment AB ~= Segment BC A (-2,0) B (10, -14) C (-4,... (answered by LinnW)