SOLUTION: Prove that, log(n) >= k.log(2) (Where n >= 2 and "k" denote the number of distinct prime divisors of n).
Algebra.Com
Question 550585: Prove that, log(n) >= k.log(2) (Where n >= 2 and "k" denote the number of distinct prime divisors of n).
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
We have
 \ge \log(2^k) \Rightarrow n \ge 2^k)
This is true because if we let 
, then we have
, and since each prime is greater than or equal to 2, this inequality holds.
RELATED QUESTIONS
Let n be a positive integer, k the number of prime numbers less than or equal to n, and... (answered by richard1234)
I have the following problem:
Let P(n, k) denote the number of permutations of k objects (answered by stanbon)
prove that for all positive integers n, sigma(2n) is greater than 2*sigma (n) (where... (answered by richard1234)
List all elements of the set A ∩ B, where
A = {n ∈ N | ∃k ∈ N... (answered by robertb)
Let {{{N = N[1] + N[2]}}} , and {{{1 <= k <= N[1]}}} and {{{1 <= k <= N[2]}}}.
Prove... (answered by robertb)
Let T(n) denote the number of distinct ways that a postage of n
cents, where n ≥ 4 and (answered by greenestamps)
Choose all the descriptions for natural numbers n that have 3 divisors.
1- n= p^2 * q... (answered by ikleyn,math_tutor2020)
1. Let X(k) denote the N-point DFT of the N-point sequence x(n)
a) If x(n)... (answered by Fombitz)
What is the Big O of (n/2) log(n/2) + f(n), where f(n) = o (sqrt n log^9... (answered by Alan3354)