java,algorithm,hash,quadratic-probing,linear-probing

There must be a proof for this out there somewhere. But, I don't see how quadratic probing could hit every bucket in most cases. Let's say the table size is 7, and h(k) is 0. For the ith iteration, probe = i^2 mod 7. I tested all i less than...