The time complexity for some algorithm is $T(n) = 2^n$ where n is the size of inputs. A particular computer takes t seconds to process n inputs. How many inputs can a computer that is 64 times as fast process during the same time t?
How would an equation be set up to solve this?
Find $n'$ with $$ T(n')=64T(n).$$