SOLUTION: Show that if n is odd integer, then n^3-n is a multiple of 24.

Algebra ->  Proofs -> SOLUTION: Show that if n is odd integer, then n^3-n is a multiple of 24.      Log On


   



Question 1070276: Show that if n is odd integer, then n^3-n is a multiple of 24.
Found 2 solutions by ikleyn, Edwin McCravy:
Answer by ikleyn(52781) About Me  (Show Source):
You can put this solution on YOUR website!
.
n%5E3+-+n = n%2A%28n%5E2-1%29 = n%2A%28n-1%29%2A%28n%2B1%29 = %28n-1%29%2An%2A%28n%2B1%29.


You have a product of three consecutive integers. 


One of them is a multiple of 3.


If n is odd, then both (n-1) and (n+1) are even, i.e. are multiples of 2.


Moreover, one of these two is a multiple of 4.


Therefore, the entire product is a multiple of 2*3*4 = 24.


QED.

Proved and solved.



Answer by Edwin McCravy(20055) About Me  (Show Source):
You can put this solution on YOUR website!
She assumed that

"If n is odd, then both (n-1) and (n+1) are even, i.e. are multiples
of 2."

I agree with that without proof.  However when she says:

"Moreover, one of these two is a multiple of 4."

although that is true, I think it must be proved before she can use it
legitimately.

I do an induction proof:

n%5E3-n=n%5E2%28n-1%29=n%28n-1%29%28n%2B1%29

Since n is odd, let n = 2m+1 where m is any integer




Then we have to prove that:

then 8m^3+12m^2+4m}}} is a multiple of 24 for any integer m

If m=1

4(1)(1+1)(2*1+1) = 4(2)(2+1) = 4(2)(3) = 24

and 24 is a multiple of 24.


Assume that m=k is such that 8k%5E3%2B12k%5E2%2B4k = 24 times some integer,

Now we consider   8%28k%2B1%29%5E3%2B12%28k%2B1%29%5E2%2B4%28k%2B1%29.  When we expand that
out we get 

8k%5E3%2B36k%5E2%2B52k%2B24%22%22=%22%22%288k%5E3%2B12k%5E2%2B4k%29%2B%2824k%5E2%2B48k%2B24%29%22%22=%22%22%288k%5E3%2B12k%5E2%2B4k%29%2B24%28k%5E2%2B2k%2B1%29

The first parenthetical expression is what we assumed was a multiple of 24 
and the second parenthetical expression is a multiple if 24 and the sum
of two multiples of 24 is a multiple of 24.

Thus the theorem is proved by induction.

Edwin