P Pedrox32 New member Joined Jun 14, 2019 Messages 2 Sep 27, 2022 #1 Hello Guys, I've stumbled in this problem and cannot find a way out. How can I prove that e^n>n^2 by mathematical induction? Thanks guys!
Hello Guys, I've stumbled in this problem and cannot find a way out. How can I prove that e^n>n^2 by mathematical induction? Thanks guys!
Otis Elite Member Joined Apr 22, 2015 Messages 4,589 Sep 27, 2022 #2 Hi. Have you used induction before, or is this your very first attempt? [imath]\;[/imath]
Dr.Peterson Elite Member Joined Nov 12, 2017 Messages 16,865 Sep 27, 2022 #3 Pedrox32 said: Hello Guys, I've stumbled in this problem and cannot find a way out. How can I prove that e^n>n^2 by mathematical induction? Thanks guys! Click to expand... This actually is not true for all n (but it is true for non-negative n). Please show the exact wording of the problem as given to you, along with what you have tried, so we can see where you "stumbled".
Pedrox32 said: Hello Guys, I've stumbled in this problem and cannot find a way out. How can I prove that e^n>n^2 by mathematical induction? Thanks guys! Click to expand... This actually is not true for all n (but it is true for non-negative n). Please show the exact wording of the problem as given to you, along with what you have tried, so we can see where you "stumbled".
J JeffM Elite Member Joined Sep 14, 2012 Messages 7,874 Sep 27, 2022 #4 As Dr. Peterson pointed out this, this proposition is not true for all rational n. What does the actual problem say? How might you start a proof by induction for the actual problem?
As Dr. Peterson pointed out this, this proposition is not true for all rational n. What does the actual problem say? How might you start a proof by induction for the actual problem?