Recent content by nuttynibbles

  1. N

    How Large Can N Be for F(n) = Log N to Run in 1 Second?

    hmm okay tks a lot peeps
  2. N

    How Large Can N Be for F(n) = Log N to Run in 1 Second?

    Hi, i finally understood. the rule that i was looking for is loga(Xy) = y.loga(X) therefore, 2106 =10y y = 106 . log10(2) However, i got another Q. if the Q was asked to use log2, must we give the final ans in log10??
  3. N

    How Large Can N Be for F(n) = Log N to Run in 1 Second?

    sorry but I am actually still confuse.. i don't really understand when char.limit said i can isolate x by taking log_10 of x and i get 106 . log_10 (2). i change x->y to avoid confusion. since the rule says: y = log_10 x, then x=10y if we continue from 2106 =10y then y =...
  4. N

    How Large Can N Be for F(n) = Log N to Run in 1 Second?

    hi char.limit, may i know which log rule define this??
  5. N

    How Large Can N Be for F(n) = Log N to Run in 1 Second?

    sorry i meant 300,000 since: 2^(10^6) = 10^x That means: since x = 10^6, therefore 10^x = 10^(10^6). but how do i get the value 10^300000??
  6. N

    How Large Can N Be for F(n) = Log N to Run in 1 Second?

    oh my.. tks if it's base 2, then: lg2 x = y x= 2^y since: f(n) = 1,000,000 microseconds n = 2^1,000,000 but why is the ans 10^3000000??
  7. N

    How Large Can N Be for F(n) = Log N to Run in 1 Second?

    Hi, I'm doing this algorithm questions and i need to find the largest size n of a problem that can be solved in time t, assuming that the algorithm to solve the problem takes f(n) microseconds. For example: f(n) = log n t = 1 seconds how do i get the largest size of n in t time...
Back
Top