What If a Hash Function Wanted Collisions?

I was reading about universal hashing last week. You know, the standard stuff: pick random coefficients a and b, compute h(x) = (ax + b) mod p, and you get a family of hash functions where collisions