Excercise 4.3.2 suppose we have n bits of memory available, and out set s has m members. instead of using k hash functions, we could divide the n bits into k arrays, and has once to each array. as a function of n, m, and k, what is the probability of a false positive?

answer: solve 5\cdot 2^x=2405⋅2  

x

=2405, dot, 2, start superscript, x, end superscript, equals, 240.

solution

to solve for xxx, we must first isolate the exponential part. to do this, divide both sides by 555 as shown below. we do not multiply the 555 and the 222 as this goes against the order of operations!

\begin{aligned} 5\cdot 2^x& =240 2^x& =48 \\ \end{aligned}  

5⋅2  

x

2  

x

​    

=240

=48

​

step-by-step explanation:

where is the diagram? shown below where? ?

step-by-step explanation:

kida saleya punjabi song

step-by-step explanation: