# 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

570

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
- 490 views
- $20.00

### Related Questions

- Logic Question π΄∨π΅→πΆβ’(π΄→πΆ)∧(π΅→πΆ)
- Find the generating function
- Discrete Math- Number of factor trees of a graph
- Discrete Structures - Proving a statement true
- [Discrete Mathematics] Big-O Notation
- Combinatorics proof by induction
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- Let A be an uncountable set, B a countable subset of A, and C the complement of B in A. Prove that there exists a one-to-one correspondence between A and C.

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