Justify $\Theta(n^7 \log n)$ for $g(n)$

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around justifying the asymptotic complexity of the function $g(n)=8n^7 \log n+18 \log{13}+16 \log n^n+12 n^{\frac{5}{2}}$. Participants explore whether $g(n)$ can be expressed as $\Theta(n^7 \log n)$ and seek to establish the dominance of the term $n^7 \log n$ in this context.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant identifies $n^7 \log n$ as the dominant term and questions how to justify this claim.
  • Another participant reiterates the need to find constants that satisfy the definition of $\Theta$ for $g(n)$.
  • A participant suggests verifying the dominance of $n^7 \log n$ by showing that other terms in $g(n)$ are smaller for sufficiently large $n$.
  • Specific comparisons are made, such as showing that $18 \log 13 \leq n^7 \log n$ for $n \geq 2$ and that $16n \log n \leq n^7 \log n$ for $n \geq 2$ as well.
  • Another participant questions whether it is sufficient to state that the dominant term is $n^7 \log n$ to conclude that $g(n)=\Theta(n^7 \log n)$ or if a more rigorous explanation is needed.
  • A later reply discusses the limit approach to establish $\Theta$ notation, suggesting that if the dominant term is correctly identified, it leads to the conclusion that $T(n) = \Theta(a(n))$.

Areas of Agreement / Disagreement

Participants express uncertainty about the sufficiency of their arguments for justifying the asymptotic notation. There is no consensus on a definitive method to conclude that $g(n)=\Theta(n^7 \log n)$, and multiple approaches are presented without resolution.

Contextual Notes

Participants rely on comparisons of growth rates and the behavior of logarithmic and polynomial functions as $n$ approaches infinity. The discussion highlights the need for careful consideration of constants and conditions in the definition of $\Theta$ notation.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hi! (Smile)

I want to find the asymptotic complexity ($\Theta$) of the function $g(n)=8n^7 \log n+18 \log{13}+16 \log n^n+12 n^{\frac{5}{2}}$.

We see that the dominant term is $n^7 \log n$, but how could we justify it? (Thinking)

Does this mean that : $g(n)=\Theta(n^7 \log n)$ ? :confused:
 
Technology news on Phys.org
According to definition we have to find constants such that

$$c_1 f(n) \leq g(n) \leq c_2 f(n) $$

is held true for all $n\geq N_0$ , Can you find such constants ?
 
ZaidAlyafey said:
According to definition we have to find constants such that

$$c_1 f(n) \leq g(n) \leq c_2 f(n) $$

is held true for all $n\geq N_0$ , Can you find such constants ?

Yes, but.. how can I explain that $n^7 \log n$ is the dominant term? (Thinking)
 
You can try to verify it by definition, that is,
$$g(n) = \Theta(n^7 \log n) \Leftrightarrow \exists c>0, \exists n_0 \in \mathbb{N}, \forall n \geq n_0: 0 \leq g(n) \leq c n^7 \log n$$

I would do the following: try to show that all terms (with exception of the first term obviously) of $g(n)$ are smaller than $n^7 \log n$ for a certain $n_0 \in \mathbb{N}$.

First, note that $\forall n \geq 2: 18 \log 13 \leq n^7 \log n$. This follows from the fact that $\log n$ and $n^7$ are increasing functions forall $n \in \mathbb{N}_0$.

Second, we can write $16 \log n^n = 16n \log n$. We want to search for which values of $n \in \mathbb{N}_0$ we have: $16 n \log n \leq n^7 \log n$ or equivalently $16 n \leq n^7$. Since $n^7$ increases much faster than $16n$ for the natural numbers (without zero) we can conlude that $\forall n \geq 2: 16n \leq n^7$, therefore $ \forall n \geq 2: 16n \log n \leq n^7 \log n$.

For the last term we can use a similar argument to show that $\forall n \geq 2: 12n^{\frac{5}{2}} \leq n^7 \log n$.

At this point we have shown that all terms are smaller than $n^7 \log n$.
What's the conclusion now?
 
At the beginning, before I verify that $g(n)=\Theta(n^7 \log n)$ can I just say the following?

We see that the dominant term of the function $g(n)$ is $n^7 \log n$, so: $g(n)=\Theta(n^7 \log n)$ ?

Or is there a better way to explain why we suppose that $g(n)=\Theta(n^7 \log n)$? (Thinking)
 
By definition

$$T(n) = \Theta( G(n) ) \, \implies \,\, \lim \frac{T(n)}{G(n)} \to c \, ; \,\, 0<c<\infty $$

Suppose that $f(n) = a(n) +g(n)$ where $a(n)$ is the dominant term so

$$\lim_{n \to \infty } \frac{a(n)+g(n)}{a(n)} = 1+ 0 = 1 $$

So $T(n) = \Theta (a(n)) \blacksquare $.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 15 ·
Replies
15
Views
8K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 17 ·
Replies
17
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K