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.

574
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
- 674 views
- $20.00
Related Questions
- Logic Question ¬¬𝐴→𝐴
- Discrete math
- [Discrete Mathematics] For {1,3,6,10,15,…}. Find a recursive formula.
- Discrete Math Question
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- Combinatorics/counting: How many configurations are possible for m differenct objects in n boxes of unlimited occupany (m<n)
- How many balanced lists of n left and n right parentheses are there?
- Discrete Math/ Set theory Question
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