Friday

January 30, 2015

January 30, 2015

Posted by **Don(please check my math)** on Thursday, October 24, 2013 at 11:20pm.

If n is an odd positive integer then by definition

n = 2k+1 for some non negative integer, k.

Now 1 - n2 = 1 - (2k+1)2 = -4k2-4k = 4 (-k2-4k).

k is a nonnegative integer, hence -k2-4k is an integer. Thus by definition

of divisibility we conclude that 4 divides 1-n2.

**Answer this Question**

**Related Questions**

discrete math - Prove by contradiction that for any even integer a and any odd ...

DISCRETE MATHS - Prove that if n is an odd positive integer, then 1 ≡ n2 (...

math - show that any positive odd integer is of the form 6q+1, 6q+3 or 6q+5, ...

math - Show that any positive odd integer is of the form 6q+1, 6q+3 or 6q+5, ...

maths - prove that any odd positive integer of 8q+1,where q is any integer?

Algebra - The sum of two consecutive odd integers is 56. A. Define a variable ...

Discrete Mathematics - Prove that if n is an odd positive integer, then 1 ≡...

maths- - if n is an odd positive integer, then prove that n^2 -1 is divisible ...

discrete math - prove that if n is an integer and 3n+2 is even, then n is even ...

Discrete Math - Theorem: For every integer n, if x and y are positive integers ...