query: Is there any fast way to find the power of 2 nearest to a large given number?
positive_passages.docid: 155548
positive_passages.text: How do I calculate the closest power of 2 or 10 a number is?
negative_passages.docid: 108588
negative_passages.text: Improving bound on $\sqrt{2 \sqrt{3 \sqrt{4 \ldots}}}$
negative_passages.docid: 36361
negative_passages.text: How to calculate the summation $(\sum_{p = k}^{n} \binom{n}{p}) / 2^n$ quickly?
negative_passages.docid: 138304
negative_passages.text: getting tight bounds on n!
negative_passages.docid: 35382
negative_passages.text: What is the fastest algorithm for finding the natural logarithm of a big number?
negative_passages.docid: 141085
negative_passages.text: Speed of calculating powers (in python)
negative_passages.docid: 50128
negative_passages.text: Efficiently finding two squares which sum to a prime
negative_passages.docid: 109055
negative_passages.text: Round number up to the nearest multiple of 3
negative_passages.docid: 14827
negative_passages.text: RSA: Fast factorization of N if d and e are known
negative_passages.docid: 143392
negative_passages.text: How to calculate the division and remainder of a big number manually
negative_passages.docid: 117047
negative_passages.text: exponentiation of cardinal number
negative_passages.docid: 105873
negative_passages.text: Construct an algorithm to find the multiple of A such that A%B is maximized
negative_passages.docid: 143927
negative_passages.text: Binomial coefficients that are powers of 2
negative_passages.docid: 100492
negative_passages.text: Fastest Square Root Algorithm
negative_passages.docid: 8257
negative_passages.text: Subtracting very small probabilities - How to compute?
negative_passages.docid: 50110
negative_passages.text: How to check if a number is a power of 2
negative_passages.docid: 112599
negative_passages.text: What is the smallest value of n such that an algorithm running at 100*n^2 operates faster than 2^n ? [How to figure out without brute force]