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

We need to show that 4 divides 1-n2 whenever n is an odd positive integer.

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

- maths - the non- decreasing sequence of odd integers {a1, a2, a3, . . .} = {1,3,...
- discrete math - Prove by contradiction that for any even integer a and any odd ...
- Algebra - The sum of two consecutive odd integers is 56. A. Define a variable ...
- 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, ...
- DISCRETE MATHS - Prove that if n is an odd positive integer, then 1 ≡ n2 (...
- maths - prove that any odd positive integer of 8q+1,where q is any integer?
- algebra 1 - PLEASE HELP! NO ONE ANSWERED THE QUESTION three times an odd integer...
- Discrete Math - Theorem: For every integer n, if x and y are positive integers ...
- Math - When you add a positive integer and a negative integer, you sometimes get...

More Related Questions