Prove that for all integers n, (-n) mod 2 = n mod 2. Give an example...

Question

Question

Prove that for all integers n, (-n) mod 2 = n mod 2. Give an example to show that it is not always true that (-n) mod 3 = n mod 3.

Professor mentioned to prove for odd and even integers, however, I don't know how to start the proof.

engineering Computer-Science

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

Find all integers x, and odd integers n such that, 1 + n^2 = x^3. Please...

Find all integers x, and odd integers n such that, 1 + n^2 = x^3. Please give an explanation with proof thank you.
1 point Prove the following statement: If n2 is even, then n is even. Order each of the following sentences so that the...

1 point Prove the following statement: If n2 is even, then n is even. Order each of the following sentences so that they form a logical proof. Proof by Contrapositive: Choose from these sentences: Your Proof: Suppose n is odd. Then by definitionn 2k +1 for some integer k Required to show if n is not even (odd), then n is not even (odd). Thus n2(2k1)2. n24k2 4k1. 22(22+2k) +1 Thus n2 (an integer) +1 and by definition is odd....
(b) Prove that n is an odd pseudoprime number if and only if 2"-1-1 mod n.

(b) Prove that n is an odd pseudoprime number if and only if 2"-1-1 mod n. (b) Prove that n is an odd pseudoprime number if and only if 2"-1-1 mod n.

Assignment 6 1. Prove by contradiction that: there are no integers a and b for which...

Assignment 6 1. Prove by contradiction that: there are no integers a and b for which 18a+6b = 1. 2. Prove by contradiction that: if a,b ∈ Z, then a2 −4b ≠ 2 3. Prove by contrapositive that: If x and y are two integers whose product is even, then at least one of the two must be even. Make sure that you clearly state the contrapositive of the above statement at the beginning of your proof. 4. Prove that...
Need help!! Please help — crypto math 1. Determine L13(18) for p 19. 2. Let p be prime, and α a primitive root mod p. Prove that α(p-1)/2-_1 (mod p). 3. It can be shown that 5 is a primitive root...

Need help!! Please help — crypto math 1. Determine L13(18) for p 19. 2. Let p be prime, and α a primitive root mod p. Prove that α(p-1)/2-_1 (mod p). 3. It can be shown that 5 is a primitive root for the prime 1223. You want to solve the discrete logarithm problem 53 (mod 1223). You know 3611 Prove it. 1 (mod 1223). Is x even or odd? 1. Determine L13(18) for p 19. 2. Let p be prime,...
Problem 4. Show that for all integers n, n2 mod 3- 1 n2 mod 3- 0...

Problem 4. Show that for all integers n, n2 mod 3- 1 n2 mod 3- 0 or (i.e. there exists an integer k such that n2 3k or n2 3k +1). mp

Let A = { n ∈ Z ∣ n ≡ 1 ( mod 2 ), then A is...

Let A = { n ∈ Z ∣ n ≡ 1 ( mod 2 ), then A is the set of Group of answer choices even integers odd integers Z∖{0} Z None of the above Q2 If A = { 1 } and B = { 2 }, then the power set, P ( A × B ) is Group of answer choices {ϕ,{A×B}} {ϕ,{1×2}} {ϕ,{(1,2)}} {ϕ,{A}×{B}} None of the above
I have first part of question good. Need to prove unique modulo and do not know where to start. Prove that the congruences x-a mod n and x b mod m admit a simultaneous solution if and only if (n, m)...

I have first part of question good. Need to prove unique modulo and do not know where to start. Prove that the congruences x-a mod n and x b mod m admit a simultaneous solution if and only if (n, m) | (a -b). Moreover, if a solution exists, then the solution is unique modulo [m, n). Prove that the congruences x-a mod n and x b mod m admit a simultaneous solution if and only if (n, m) |...
Problem 2. Find (with proof) all positive integers n that have an odd number of positive...

Problem 2. Find (with proof) all positive integers n that have an odd number of positive divisors (for example 6 has 4 positive divisors 1,2,3,6).

The symbol N denotes the nonnegative integers, that is, N= {0,1,2,3,...}. The symbol R denotes the...

The symbol N denotes the nonnegative integers, that is, N= {0,1,2,3,...}. The symbol R denotes the real numbers. In each of the proofs by induction in problems (2), (3), and (4), you must explicitly state and label the goal, the predicate P(n), the base case(s), the proof of the base case(s), the statement of the inductive step, and its proof. Your proofs should have English sentences connecting and justifying the formulas. As an example of the specified format, consider the...