I am not sure how to handle this problem given no base case. Is it enough to assume that $T(n/5) + T(7n/10) <= c(n/5) + c(7n/10)$, and substitute that back in? This seems like a weak way of proving it.
2026-03-27 01:46:36.1774575996
Solving the recurence $T(n) = T(n/5) + T(7n/10) + n$ using substitution method
4.9k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in INDUCTION
- Show that the sequence is bounded below 3
- Fake induction, can't find flaw, every graph with zero edges is connected
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
- Prove $\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$ using binomial and induction
- Induction proof of Fibonacci numbers
- The Martian Monetary System
- How to format a proof by induction
- $x+\frac{1}{x}$ is an integer
- Help with induction proof please! For an integer $n, 3$ divides $n^3-n$
- Proving $\sum_{k=1}^n kk!=(n+1)!−1$
Related Questions in RECURRENCE-RELATIONS
- Recurrence Relation for Towers of Hanoi
- Solve recurrence equation: $a_{n}=(n-1)(a_{n-1}+a_{n-2})$
- General way to solve linear recursive questions
- Approximate x+1 without addition and logarithms
- Recurrence relation of the series
- first order inhomogeneous linear difference equation general solution
- Guess formula for sequence in FriCAS
- Solve the following recurrence relation: $a_{n}=10a_{n-2}$
- Find closed form for $a_n=2\frac{n-1}{n}a_{n-1}-2\frac{n-2}{n}a_{n-2}$ for all $n \ge 3$
- Young Tableaux generating function
Related Questions in COMPUTER-SCIENCE
- What is (mathematically) minimal computer architecture to run any software
- Simultaneously multiple copies of each of a set of substrings of a string.
- Ackermann Function for $(2,n)$
- Algorithm for diophantine equation
- transforming sigma notation into harmonic series. CLRS A.1-2
- Show that if f(n) is O(g(n) and d(n) is O(h(n)), then f(n) + d(n) is O(g(n) + h(n))
- Show that $2^{n+1}$ is $O(2^n)$
- If true, prove (01+0)*0 = 0(10+0)*, else provide a counter example.
- Minimum number of edges that have to be removed in a graph to make it acyclic
- Mathematics for Computer Science, Problem 2.6. WOP
Related Questions in RECURSION
- Solving discrete recursion equations with min in the equation
- Recognizing recursion relation of series that is solutions of $y'' + y' + x^2 y = 0$ around $x_0 = 0$.
- Ackermann Function for $(2,n)$
- Primitive recursive functions of bounded sum
- Ackermann Function for $f(2,n)$ as compared to $f(5,1)$
- Determinant of Block Tridiagonal Matrix
- In how many ways can the basketball be passed between four people so that the ball comes back to $A$ after seven passes? (Use recursion)
- Finding a recursive relation from a differential equation.
- A recursive divisor function
- Are these numbers different from each other?
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?
Your assumption is right. We claim that that $T\left(n\right)=\mathcal{O}\left(n\right)$. Then, we must show that there exists $c_{1}>0$ and $n_{0}$ such that for all $n\ge n_{0}$, $T\left(n\right)\le c_{1}n$. For the base case, since you are given no information on this, the only reasonable thing that I see is that you would substitute $n=0$ and be forced with $T\left(0\right)=0$, which satisfies $T\left(0\right)=0\le c_{1}\cdot0$. Now assume that for all $k<n$, $T\left(k\right)\le c_{1}k$. Then,
\begin{align*} T\left(n\right)&=T\left(\frac{n}{5}\right)+T\left(\frac{7n}{10}\right)+n\\ &\le c_{1}\frac{n}{5}+c_{1}\frac{7n}{10}+n\\ &=\left(\frac{9c_{1}+10}{10}\right)n. \end{align*}
We want to find $c_{1}>0$ such that $\left(\frac{9c_{1}+10}{10}\right)n\le c_{1}n$ for all $n\ge n_{0}$. Rearranging this inequality, we end up with $10n\le c_{1}n$ and so $c_{1}\ge10$ when $n\ge0$. Thus, we have shown by the substitution method that $T\left(n\right)=\mathcal{O}\left(n\right)$.
By a similar argument (except replacing $T\left(k\right)\le c_{1}k$ with $T\left(k\right)\ge c_{2}k$), we see that $0<c_{2}\le10$ for all $n\ge0$ and end up with that $T\left(n\right)=\Omega\left(n\right)$. Thus, $10n\le T\left(n\right)\le 10n$, giving us that $T\left(n\right)=10n$ for all $n\ge0$ and so $T\left(n\right)=\Theta\left(n\right)$.
There is an alternative way to go about this as well. If we suppose that $T\left(x\right)=\Theta\left(x\right)$ (I have changed the domain from $\mathbb{N}$ to $\mathbb{R}$) from the start, then we know that $T\left(x\right)=ax+b$ for some $a,b\in\mathbb{R}$. Substituting this into our recurrence relation, we have \begin{align*} ax+b&=\frac{1}{5}\left(ax+b\right)+\frac{7}{10}\left(ax+b\right)+x\\ &=\frac{9a+10}{10}x+\frac{9}{10}b. \end{align*}
Comparing coefficients on the left and right sides of the equation, we arrive at $a=10$ and $b=0$, giving us $T\left(x\right)=10x$.