Question

Prove that if 4 does not divides n, then 8 does not divides n^2. * Use...

Prove that if 4 does not divides n, then 8 does not divides n^2.

* Use the division algorithm and proof by cases with r = 1,2 and 3

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
For all integers a and b, if 3 divides (a^2+b^2) then 3 divides a and 3...
For all integers a and b, if 3 divides (a^2+b^2) then 3 divides a and 3 divides b. (Use Division algorithm and congruence).
Use Mathematical Induction to prove that for any odd integer n >= 1, 4 divides 3n+1.
Use Mathematical Induction to prove that for any odd integer n >= 1, 4 divides 3n+1.
If n is an odd integer, prove that 12 divides n2+(n+2)2+(n+4)2+1. Please provide full solution!
If n is an odd integer, prove that 12 divides n2+(n+2)2+(n+4)2+1. Please provide full solution!
1. Prove that 21 divides 3n7 + 7n3 + 11n for all integers n. 2. Prove...
1. Prove that 21 divides 3n7 + 7n3 + 11n for all integers n. 2. Prove that n91 ≡ n7 (mod 91) for all integers n. Is n91 ≡ n (mod 91) for all integers n ?
Prove the folllwing case and use the Contrapositive approach to the proof. If n^2 + 2...
Prove the folllwing case and use the Contrapositive approach to the proof. If n^2 + 2 is not divisible by 3, then n is divisible by 3. First state the contrapositive before you begin the proof.
Consider the following statement: if n is an integer, then 3 divides n3 + 2n. (a)...
Consider the following statement: if n is an integer, then 3 divides n3 + 2n. (a) Prove the statement using cases. (b) Prove the statement for all n ≥ 0 using induction.
Let h € N be a prime. Now prove for all b € N, h divides...
Let h € N be a prime. Now prove for all b € N, h divides b^h -b.
Prove that there is no positive integer n so that 25 < n^2 < 36. Prove...
Prove that there is no positive integer n so that 25 < n^2 < 36. Prove this by directly proving the negation.Your proof must only use integers, inequalities and elementary logic. You may use that inequalities are preserved by adding a number on both sides,or by multiplying both sides by a positive number. You cannot use the square root function. Do not write a proof by contradiction.
Show that if n2+2 and n2-2 are both prime, then 3 divides n. Note: This question...
Show that if n2+2 and n2-2 are both prime, then 3 divides n. Note: This question was asked in the context of congruences/ modulus in a Number Theory class. Please give a NEATLY written proof in full sentences. State any theorems, definitions, and formulas used.
use the fundamental theorem of arithmetic to prove: if a divides bc and gcd(a,b)=1 then a...
use the fundamental theorem of arithmetic to prove: if a divides bc and gcd(a,b)=1 then a divides c.