SOLUTION: using deductive methods prove that if n is an interger, n is greater than or equal to 2 , then f(n)= n cubed

SOLUTION: using deductive methods prove that if n is an interger, n is greater than or equal to 2 , then f(n)= n cubed - n is always divisible by at least 6

Question 35101: using deductive methods prove that if n is an interger, n is greater than or equal to 2 , then f(n)= n cubed - n is always divisible by at least 6
Answer by venugopalramana(3286) (Show Source): You can put this solution on YOUR website!
F(N)=N^3-N=N(N^2-1)=N(N+1)(N-1)=(N-1)N(N+1)=PRODUCT OF 3 CONSECUTIVE INTEGERS.
SO ONE OF THEM IS DEFINITELY DIVISIBLE BY 2.
FURTHER WHEN WE DIVIDE A NUMBER WITH 3 WE CAN GET A REMAINDER OF 1 OR 2 OR 0 THAT IS DIVISIBLE BY 3.SO SINCE THIS IS A PRODUCT OF 3 CONSECUTIVE INTEGERS,ONE OF THEM HAS TO BE DIVISIBLE BY 3.
SO WE GET THAT THE PRODUCT IS DIVISIBLE BY 2 AS WELL AS 3.HENCE THE PRODUCT IS DIVISIBLE BY 6
RELATED QUESTIONS
Prove than sum(1/(r^2),r=1,n)is greater than or equal to 2- (1/n) for n is greater than... (answered by Edwin McCravy)

Prove that n^2-n is always... (answered by math_tutor2020,greenestamps)

show that if n is an integer greater than 3,... (answered by venugopalramana)

For what positive integers n greater than or equal to 2 is... (answered by Edwin McCravy)

which is greater? (n+2)(n+1)(n)(n-1)(n-2) or... (answered by Alan3354)

Prove: If n is an integer, then n^2 + n^3 is an even... (answered by jim_thompson5910)

In -2< n greater than or equal to 3,what is the value of n? (answered by ikleyn,MathLover1,greenestamps)

prove that n^3-n is always divided by... (answered by htmentor)

If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n>or=0 then f(2)... (answered by greenestamps)