Question

In: Advanced Math

prove that for x is an odd, positive integer, 3x ≡−1 (mod 4). I'm not sure...

prove that for x is an odd, positive integer, 3x ≡−1 (mod 4). I'm not sure how to approach the problem. I thought to assume that x=2a+1 and then show that 3^x +1 is divisible by 4 and thus congruent to 3x=-1(mod4) but I'm stuck.

Solutions

Expert Solution

Since is an odd integer so there exist an integer such that .

To show that , we need to prove that 4 divides .

Now ,

Now we will use induction on   to prove that for every natural number , 4 divides .

Base Case : For ,

, which is divisible by 4 .

Induction Hypothesis : Suppose the statement is true for that is ,

is divisible by 4 .

for some integer k .   

Induction Step : For ,

  

[ Using (i) ]

which is a multiple of 4 and so divisible by 4 .

So the statement is true for a=m+1 if we assume it is true for a=m also the statement is true for a=0 . Hence by induction on a , 4 divides for all integer a .

4 divides if x is odd .

Hence if x is an odd , positive integer then   .

.

.

.

.

.

If you have doubt at any step or need more clarification at any step please comment .


Related Solutions

Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod...
Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod 4) or n ≡ 3 (mod 4), then n is not a perfect square.
Find the smallest positive integer x that satisfies the system of congruences x ≡ 3 (mod...
Find the smallest positive integer x that satisfies the system of congruences x ≡ 3 (mod 5). x ≡ 5 (mod 7). x ≡ 7 (mod 11)
Solve a system of equations: 1- 2x = 5 mod 15   3x = 1 mod 4...
Solve a system of equations: 1- 2x = 5 mod 15   3x = 1 mod 4 2- x = 5 mod 15 x = 2 mod 12 (Hint: Note that 15 and 12 are not relatively prime. Use the Chinese remainder theorem to split the last equation into equations modulo 4 and modulo 3)
prove that if an even integer n is subtracted from an odd integer m. then m...
prove that if an even integer n is subtracted from an odd integer m. then m - n is odd.
Prove the following statements! 1. There is a bijection from the positive odd numbers to the...
Prove the following statements! 1. There is a bijection from the positive odd numbers to the integers divisible by 3. 2. There is an injection f : Q→N. 3. If f : N→R is a function, then it is not surjective.
Prove that for an integer k, k2 + 4k + 6 is odd if and only...
Prove that for an integer k, k2 + 4k + 6 is odd if and only if k is odd.
prove that every integer is either even or odd but never both.
prove that every integer is either even or odd but never both.
Let x, y ∈ Z. Prove that x ≡ y + 1 (mod 2) if and...
Let x, y ∈ Z. Prove that x ≡ y + 1 (mod 2) if and only if x ≡ y + 1 (mod 4) or x ≡ y + 3 (mod 4)
Mystery(y, z: positive integer) 1 x=0 2 while z > 0 3       if z mod 2...
Mystery(y, z: positive integer) 1 x=0 2 while z > 0 3       if z mod 2 ==1 then 4                x = x + y 5       y = 2y 6       z = floor(z/2)           //floor is the rounding down operation 7 return x Simulate this algorithm for y=4 and z=7 and answer the following questions: (3 points) At the end of the first execution of the while loop, x=_____, y=______ and z=_______. (3 points) At the end of the second execution of...
Prove that the following is true for all positive integers n: n is odd if and...
Prove that the following is true for all positive integers n: n is odd if and only if n2 is odd.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT