Recurring Equations: Solving for T(n) with Mathematical Induction

[XodoX]

Homework Statement

Solve the recurrence: T(n) = T(n/7) + T(4n/5) + n for n > 35 with base case T(n) = constant for n ≤ 35.

Homework Equations

The Attempt at a Solution

Is this mathematical induction? No idea how to do this one.

 

[HallsofIvy]

You seem to be missing a "=". Where is it supposed to be?

 

[oli4]

Hi XodoX, it does look like a recurrence, except, as HallsofIvy is pointing, the recurrence rule is missing.
Is this T(n+1)=T(n)+T(n/7)+T(4n/5)+n ? (T(36)=3c+35)
if it is, what when n is not a multiple of 7 and 4n is not a multiple of 4 ? we take the floor / ceiling ? do you have some context around this question ?

Cheers...

 

[XodoX]

Fixed it. Sorry, wrong button.

 

[oli4]

Still, is 36/7=5 ? is 144/5=28 ?
just to make sure we are solving the right problem, do you have some context around this puzzle ?

Cheers...

 

[XodoX]

No, nothing else. So plug in numbers? But the equation does not hold up. I don't get it.