Helping students gain understanding and self-confidence in algebra.
ricky.rick wrote:So I am confused on this problem for my discrete math class, I didn't know if there was a specific formula you were supposed to use or what. The question is "What is the largest n for which one can solve within one second a problem using an algorithm that requires f(n) bit operations, where each bit operation is carried out in 10^-6 seconds, with these functions?
ricky.rick wrote:a. f(n)= n^3
ricky.rick wrote:so for the first question n would be n<= 10 * 10^2/3?
ricky.rick wrote:b) (5log(10))/log(3)