Why, If two objects are not equal according to equals, they are not required to return different hashCode values?
<blockquote>
  <p><strong>Possible Duplicates:</strong><br>
  <a href="http://stackoverflow.com/questions/1678205/in-java-why-must-equals-and-hashcode-be-consistent">In Java, why must equals() and hashCode() be consistent?</a><br>
  <a href="http://stackoverflow.com/questions/4360035/why-hashcode-can-return-the-same-value-for-different-objects-in-java">Why hashCode() can return the same value for different objects in java?</a>  </p>
</blockquote>



<p>In JAVA API we can see that</p>

<blockquote>
  <p>If two objects are not equal according
  to equals, they are not required to
  return different hashCode values.</p>
</blockquote>

<p>Why is it so?</p>

<p>If two objects are not equal according to equals, then it should be required to return different hashCode values right?</p>
