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?

Add, subtract, multiply, or divide as indicated. list any restrictions for the variable(s) and simplify the answers when possible. 1) x-2 / x+5 + 3x / 2x-1 2) x+6 / x-6 - x^2 / x+6 3) x+9 / x-4 + x+2 / x^2-11x+28 4) x / x^2-64 + 11 / 2x^2+11x-40 5) 5 / x + 11 / x-3 - x-4 / x^2+2x-15