Given a function $$ f(n) = f(5n/13) + f(12n/13) + n \;\;\;\;∀n \geq 0 $$ I would like to find a function $g(n)$ such that $f ∈ Ө(g(n))$.
2026-03-29 05:42:55.1774762975
How can I solve this recurrence problem?
100 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ALGORITHMS
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Do these special substring sets form a matroid?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Correct way to prove Big O statement
- Product of sums of all subsets mod $k$?
- (logn)^(logn) = n^(log10+logn). WHY?
- Clarificaiton on barycentric coordinates
- Minimum number of moves to make all elements of the sequence zero.
- Translation of the work of Gauss where the fast Fourier transform algorithm first appeared
- sources about SVD complexity
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 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 PROBLEM-SOLVING
- How do you prevent being lead astray when you're working on a problem that takes months/years?
- How to prove the inequality $\frac{1}{n}+\frac{1}{n+1}+\cdots+\frac{1}{2n-1}\geq \log (2)$?
- How to solve higher order polynomial equations?
- Methods in finding invariant subspaces?
- Question about the roots of a complex polynomial
- Using a counting argument to prove some equalities? (Problem Solving)
- (Problem Solving) Proving $\sum_{k=0}^{n}(-1)^k\binom{n}{k}\frac{1}{k+m+1}=\sum_{k=0}^{m}(-1)^k\binom{m}{k}\frac{1}{k+n+1}$
- (Problem Solving) Proving $|x|^p +|y|^p \geq |x+y|^p$
- Each vertex of the square has a value which is randomly chosen from a set.
- Fill in the blanks
Related Questions in RECURSIVE-ALGORITHMS
- Designing an algorithm for integer multiplication
- Pre - calc problem turned hard, easier method for this formula?
- Simple recursive algorithms to manually compute elementary functions with pocket calculators
- Divide set into two subsets of equal sum and maximum this sum
- How many times can I do (n-1)/2 and get a whole number, recursive to formula
- Solving $A_{n+1}=3A_n+2^n$
- How to get QuickSort algorithm to run in any time between $n\log n$ and $n^2$
- Counting the number of binary heaps created with N elements with duplicite numbers
- Computation of compositions of ceilings and divisions
- How do I fight loss of significance and/or improve convergence for this recursive algorithm?
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?
The Akra-Bazzi theorem gives us a way of tackling the complexity of $T$ given a recurrence of the form $$T(n)=g(n) + \sum_{i=1}^k a_i T(b_i n + h_i(n))$$
Here, we have $f(n)=f(5n/13)+f(12n/13)+n$. So our first focus is on solving $p$ such that $a_1 b_1^p+a_2b_2^p=1$ where $a_1=a_2=1$ and $b_1=5/13,b_2=12/13$; equivalenty, we have $$5^p+12^p=13^p$$
Recall that $(5,12,13)$ is a Pythagorean triple so clearly $p=2$.The theorem then tells us $$f(n)\in\Theta\left(n^2\left(1+\int_1^n \frac1{u^2} du\right)\right)$$
Since $\int_1^n\frac1{u^2}du=1-\frac1n$ this gives us $f(n)\in\Theta(n^2)$.