"What is the smallest value of $n$ such that an algorithm whose running time is $100n^2$ runs faster than an algorithm whose running time is $2^n$ on the same machine?"
I know the answer is $n = 15$, but is there any way to solve this without trial and error?