![]() |
Problem 2.5 - Proof by induction
I got stuck solving this problem. I know it is a simple proof by induction, but there is something I keep missing here. Has anybody tried to solve it? Any hints would be greatly appreciated.
|
Re: Problem 2.5 - Proof by induction
Oh I see now, thank you professor!
|
Re: Problem 2.5 - Proof by induction
1 Attachment(s)
Hi,
After seeing the reply from Prof. Mostafa, I have attempted to solve problem 2.5. I have also attached my solution with this reply. However, I am not sure whether my approaches are right or not. It would be great if someone please validate my approaches. I know my approaches are naive, thus any pointer, how to improve this solution would be highly appreciated. Thank You. |
Re: Problem 2.5 - Proof by induction
Your approach can work. To carry through your induction, you need an inequality like
![]() You can also prove the result by induction on D, which is easier (instead of induction on N). Quote:
|
All times are GMT -7. The time now is 01:52 AM. |
Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.