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]
112599
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]
64883
What is the most efficient algorithm to find the closest prime less than a given number $n$
141183
How to determine highest power of $2$ in $3^{1024}-1$?
158645
How to find time complexity of an algorithm
141647
Finding the index value of the smallest number in a list?
20471
Evaluating a slow sum
91565
How to efficiently compute $\,25^{37}\pmod{55}$?
86342
Why does $\log(n!)$ and $\log(n^n)$ have the same big-O complexity?
49626
Find the last two digits of $33^{100}$
32653
Smallest integer divisible by all up to $n$
57644
Lower bounds for ${{2n} \choose {n}}$
114404
For which positive integer values of $n$ does $a|mn-b?$
124901
Big-O notation and polynomials
10191
Binomial theorem: divisibility by $n^2$
115454
Primality test bound: square root of n
116540
Positive integers less than 1000 without repeated digits
138178
Proving the number of iterations in the Euclidean algorithm