Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
zeros and 1 at the K-th place in a N-bit hash . Then: Let b be the number of ways of obtaining less than K-1 trailing zeros in an N-bit hash. Then: To generate a sequence of n input hashes such that at-least one of the input hashes have K-1 trailing zeros and the remaining have less than K-1