double estimateExactK(double k, int n) {
        return estimateExactK(k, n, defaultP);
    }
Use StudentT distribution and estimate how many hits you need from each partition
to to get the globally top-k documents with the desired probability

@author baldersheim
container-search/src/main/java/com/yahoo/search/dispatch/TopKEstimator.java