Understanding the Relationship Between Logarithmic and Exponential Functions

  • Context: Undergrad 
  • Thread starter Thread starter mikeng
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around understanding the inequality log(n) < n^a for all n, a > 0, exploring the intuition behind it, and examining related concepts such as increasing functions and the definition of big O notation. Participants express uncertainty and seek clarification on various aspects of the inequality and its implications.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants express difficulty in intuitively understanding why log(n) < n^a holds for all n, a > 0, particularly questioning the role of small epsilon values that might affect the inequality.
  • There is a suggestion to use derivatives to analyze the inequality, with one participant proposing to show that 1/x < a*x^(a-1) or equivalently 1 < a*x^a.
  • Another participant mentions the concept of increasing functions, which satisfy the property that if x < y, then g(x) < g(y).
  • Concerns are raised about the statement that log(n) is O(n^c) for any c > 0, with participants questioning the validity of this claim and discussing the importance of constants in big O notation.
  • Some participants acknowledge that while log(n) can be larger than n^a for certain values, it is always bounded by a constant factor c that depends on a.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the implications of the inequality log(n) < n^a, with some expressing confusion over the conditions under which it holds and the role of constants in big O notation. The discussion remains unresolved regarding the specifics of proving the inequality and the existence of such constants.

Contextual Notes

Participants note limitations in their understanding of the inequality and the definitions involved, particularly regarding the role of constants in big O notation and the behavior of logarithmic versus polynomial functions.

mikeng
This is probably really easy, but i am really rusty and i want to really understand.
I am trying to understand why log(n) &lt; n^a For all n,a>0.
I am really having a hard time to get an intuition over this, of course if i let a >= 1 then its obvious, but how do i know if there is not some extremely small epsilon that breaks the inequality. I understand maybe i should use that in a proof but i am kinda stuck.

Also this is not really directly related but a thought i had, is there a name for functions that has the property that if x < y then g(x) < g(y), I'm curious.
 
Physics news on Phys.org
mikeng said:
This is probably really easy, but i am really rusty and i want to really understand.
I am trying to understand why log(n) &lt; n^a For all n,a>0.
I am really having a hard time to get an intuition over this, of course if i let a >= 1 then its obvious, but how do i know if there is not some extremely small epsilon that breaks the inequality. I understand maybe i should use that in a proof but i am kinda stuck.

Also this is not really directly related but a thought i had, is there a name for functions that has the property that if x < y then g(x) < g(y), I'm curious.

Functions that satisfy ##x < y \Rightarrow g(x) < g(y)## are called increasing functions. You might want to read this: https://en.wikipedia.org/wiki/Monotonic_function
 
  • Like
Likes   Reactions: mikeng
Math_QED said:
Functions that satisfy ##x < y \Rightarrow g(x) < g(y)## are called increasing functions.
Thanks, that makes sense :)
 
I see did not occur to me to use derivatives.
I have been looking this over to try to see if i missed something but correct me if i am wrong but this does only show log(x) < x. But i wonder if there is a constant a such that x^a &lt; log(x)
Hmm but using derivatives then we must show that
1/x < a*x^(a-1)
Or is my thinking wrong?
Or more simpler that 1&lt; a*x^a
 
mikeng said:
This is probably really easy, but i am really rusty and i want to really understand.
I am trying to understand why log(n) &lt; n^a For all n,a>0.
Try n = 100, a = .001
 
  • Like
Likes   Reactions: mikeng
mikeng said:
Thanks, but then i must have misunderstood the origin of the question, it says. recall that for any c > 0, log(n) is O(n^c ).
This is the first problem from here https://ocw.mit.edu/courses/electri...fall-2011/assignments/MIT6_006F11_ps1_sol.pdf

There must be something i am missing here, cause clearly this is not true for all c> 0

Hold on a minute lol i forgot the constant, i can choose my constant in the definition of big oh, to cancel any c>0, or?

Well after thinking not sure how to find such a constant. Hmm i am prob making this allot more complicated.
 
Last edited by a moderator:
The constant is the important difference. log(n) can be larger than na, but no matter which a you choose, it will always be at most some factor c larger (c depends on a). Finding a specific c can be challenging but it is not necessary. It is sufficient to show that such a c exists.
 
  • Like
Likes   Reactions: mikeng
mfb said:
The constant is the important difference. log(n) can be larger than na, but no matter which a you choose, it will always be at most some factor c larger (c depends on a). Finding a specific c can be challenging but it is not necessary. It is sufficient to show that such a c exists.

Thanks it makes sense, will continue to think of how to prove that, to show that no matter how much bigger log(n) is then n^a, it is always bigger by some constant factor. But at least i understand why it is true, just want to prove it. Thanks :)
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
3
Views
3K
  • · Replies 54 ·
2
Replies
54
Views
7K
  • · Replies 12 ·
Replies
12
Views
5K