Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
maximum number of trailing zeros seen so far is K. Let the number of inputs seen so far be n. Let r = (2^N), N is the total number of bits. Let P be the number of ways by which we can have n N-bit numbers such that the number of trailing zeros ranges from 0 to K for all n numbers. Similarly, let Q