I need help - I have to express this function: $f(n)=15n \log n + 12n + 9 \log n +25$ in terms of big theta notation. I believe that it is $\Theta(n \log n)$, but I have to prove it mathematically. My math is awful, so if you could explain step by step that would be fantastic!
2026-04-09 16:33:04.1775752384
Big Theta Expression Question
3.3k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ASYMPTOTICS
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- How to find the asymptotic behaviour of $(y'')^2=y'+y$ as $x$ tends to $\infty$?
- Correct way to prove Big O statement
- Proving big theta notation?
- Asymptotics for partial sum of product of binomial coefficients
- Little oh notation
- Recurrence Relation for Towers of Hanoi
- proving sigma = BigTheta (BigΘ)
- What's wrong with the boundary condition of this $1$st order ODE?
- Every linearly-ordered real-parametrized family of asymptotic classes is nowhere dense?
Related Questions in COMPUTATIONAL-COMPLEXITY
- Product of sums of all subsets mod $k$?
- Proving big theta notation?
- Little oh notation
- proving sigma = BigTheta (BigΘ)
- sources about SVD complexity
- Is all Linear Programming (LP) problems solvable in Polynomial time?
- growth rate of $f(x)= x^{1/7}$
- Unclear Passage in Cook's Proof of SAT NP-Completeness: Why The Machine M Should Be Modified?
- Minimum Matching on the Minimum Triangulation
- How to find the average case complexity of Stable marriage problem(Gale Shapley)?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
We need to show that there exist constants $k_1$ and $k_2$ such that $$k_1 n\log n \le f(n) \le k_2 n\log n$$ whenever $n$ is sufficiently large.
It is clear that $15n\log n \le f(n)$. so we can take $k_1=15$.
Now we need to find a constant $k_2$ such that if $n$ is large enough, then $f(n)\le k_2 n\log n$.
We assume that $\log$ means logarithm to the base $e$, though what we will write will be correct also if the base is $2$. Very minor change is needed if base $10$ is meant.
Note that $12n \le 12 n\log n$ if $n\ge 3$.
Also, $9\log n \le n\log n$.
Finally, $25\le 25n\log n$ if $n\ge 25$. (Of course we don't need to go all the way to $25$.)
Thus $f(n)\le (15+12+9+25)n\log n$ if $n\ge 25$. So we can take $k_2=61$.
Remark: We do not need to exhibit explicit $k_1$ and $k_2$: showing that they exist is enough. But in this example, giving explicit $k_1$ and $k_2$ is not hard, so for the sake of concreteness we might as well do it.