A Bloom filter with m bits and k hash functions holds n items. What happens to the false positive rate as n grows?