How do I write a hashcode to minimise collisions?

I know the ideal hashcode algorithm is a research area, but what sensible things can I do to minimise collisions 开发者_Go百科and why do they work?

For example, I've seen hashcode functions that make use of prime numbers, but I'm not clear on what the benefit is...