You are Here: Home >< Maths

# Help! cannot solve P4 problem Watch

1. Hi friends,

I got in to this problem from Jan 2002 P4 question paper. The problem is that I need to deduce n(n-1)(2n+5) is divisible by 6 for all n>1. How do I deduce this without induction? This question has only 2 marks.

2. I've not done it properly but you could try to look at what happens when n is odd and even?
3. A number is divisible by 6 iff it is divisible both by 2 and 3.

If you consider even n (say 2k) or odd n (2k+1) you should find both work.

Then 3k, 3k+1 and 3k+2 for possibilities modulo 3 ( like odd/even but using 3 )

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: December 18, 2010
Today on TSR

### Degrees to get rich!

... and the ones that won't

### Cambridge interviews pour in...

Discussions on TSR

• Latest
• ## See more of what you like on The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

• Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams

## Groups associated with this forum:

View associated groups
Discussions on TSR

• Latest
• ## See more of what you like on The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

• The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.