Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am kind of confused on this problem although it seems extremely simple. So I am supposed to determine the largest size n of a problem that can be solved in time t, assuming that the algorithm takes f(n) seconds to solve a problem of size n. Given is the function: n^2+100 for 1 minute.

Normally if this was n^2 I could just put in n = 7 (if rounded).

But for n^2+100 there is no real answer. I know that if n gets sufficiently large the 100 can just be ignored.

So is the answer just N/A, i.e. the algorithm cannot be solved in 1 second even with size 0?

Thanks a lot for any responses.

share|cite|improve this question
What does "algorithm takes f(n) seconds of a function n^2+100 for 1 minute" mean? – Vedran Šego Sep 15 '13 at 0:44

If you mean that a problem of size $n$ takes $n^2+100$ seconds, you are correct that even a problem of size $1$ takes $101$ seconds, which is greater than one minute.

share|cite|improve this answer
Ok, thanks, ya that makes most sense. – user596 Sep 15 '13 at 0:47

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.