Not understand hash function

why we are taking mod again with p ?, p = ( p * p ) % total size, we are taking mod in the int idx = find + ( key [j] * p ) % total size.

Hello @amit0001 modulus is required because we want idx to be inside the table size.

yes, I got it, but you can explain it with one example?