title: What is the largest n for which one can solve within one second
body: <p>This is a suggested exercise from the Rosen Discrete Mathematics book. I am not looking for the answer ,  I already have the answer.  I am looking for someone to help explain the steps/means/procedures (what have you)it takes to get the answer.</p>
  
  <p>The question is : </p>
  
  <p>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^-9 seconds, with these functions f (n)?
  Part C:</p>
  
  <p>c. n*log(n)
  I know the answer is :</p>
  
  <p>f(n)&lt;= 10^9</p>
  
  <p>n*log(n)&lt;=10^9</p>
  
  <p>n&lt;= 3.96x10^7
  so n must be 3.96x10^7</p>
  
  <p>The solution manual has given this answer, but it does not tell me how to get the answer. What must I do to get</p>
  
  <p>n&lt;= 3.96x10^7 from :</p>
  
  <p>n*log(n) &lt;= 10^9</p>
  
  <p>Much thanks to anyone that helps me understand this</p>