Suppose n is an integer. What kind of bounds do we know for how close the closest prime p > n will be?
I'd especially appreciate an answer that pushes me in the right direction of proving a good bound for this without showing the proof fully.
Context: I ran into this while coming up to a solution for http://stackoverflow.com/questions/4058172/tricky-algorithm-interview-question. Depending on the bound, the algorithm I come up with may or may not be deterministic.