What is a sensible prime for hashcode calculation?

Question

Eclipse 3.5 has a very nice feature to generate Java hashCode() functions. It would generate for example (slightly shortened:)

class HashTest {
    int i;
           


        

Answer 1

I'd choose 7243. Large enough to avoid collissions with small numbers. Doesn't overflow to small numbers quickly.