# Proof by induction the following recursive equation

## Answer

**Answers can only be viewed under the following conditions:**

- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

Savionf

553

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.

- answered
- 414 views
- $20.00

### Related Questions

- Recursive Set
- Combinatorics proof by induction
- Logic Questions (𝐴→𝐶)∧(𝐵→𝐶)⊢(𝐴∧𝐵)→𝐶
- [Discrete Mathematics] Big-O Notation
- Solve summation problem: $\sum_{k=1}^{n} \tfrac{2k+1}{k^{2}(k+1)^2 } $
- Logic Question ¬¬𝐴→𝐴
- [Discrete Mathematics] Algorithm and Pseudocode - Write an algorithm to find the roots of a quadratic equation ax2 + bx + c = 0. Write Pseudocode of algorithm.
- Combinatorics Questions: Card Pairs, Letter Arrangements, and Number Sequences

nobody? more bounty or what? cant be that hard for specialists

Are you sure those are the right possible answers? Because it looks to me the problem is O(log n)

This is a very time consuming problem. Can you increase the bounty to $20?

yes i can, but the website doesnt allow me too, i will open a new one.

Are you sure, you should be able to increase the bounty from the side box.

I meant are you sure?

Or I can answer this one and you can leave a tip after.

i increased the bounty but please solve it with induction, maste theorem is not allowed for me and pls step by step, so i can also understand it