Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
relation to solve for H: The 1st component refers to the case where we have formed n-1 hashes with j hashes from set ‘a’ and h-j from set ‘b’. For the remaining n-th hash, I can pick any one of the h hashes selected so far. The 2nd component refers to the case where we have formed n-1 hashes with