# Proof by induction the following recursive equation

## Answer

**Answers can be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

Savionf

516

The answer is accepted.

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

- answered
- 282 views
- $20.00

### Related Questions

- Logic quesiton A v ¬A
- Discrete math- Range and preimage of the floor function
- Discrete Math Question
- Discrete Structures - Proving a statement true
- Problem Help - Matrix/Markov
- Discrete Structures - Proving a statement false by proving the negation to be true
- Probability of making a full house in a poker hand
- Growth of Functions

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