FIND THE ANSWERS

Let n>=2 and let n=p1p2...pk be its prime factorization, where the primes are not necessarily distinct. Prove that <= log-2n?

Answer this question

Do you know the correct answer? Make money answering questions! Join now.
  • Let n>=2 and let n=p1p2...pk be its prime factorization, where the primes are not necessarily distinct. Prove that <= log-2n?


Answers