ngkamsengpeter
- 193
- 0
How to prove that [tex]2^n > n^2[/tex] when n>4 ?
The discussion revolves around proving the inequality 2^n > n^2 for n > 4 without using mathematical induction. Participants are exploring the nature of exponential and polynomial functions in this context.
The discussion is ongoing, with various approaches being considered. Some participants have suggested using derivatives to analyze the behavior of the functions, while others are questioning the necessity and validity of using induction. There is a mix of perspectives on how to approach the proof without induction.
Participants are focused on proving the inequality specifically for integer values of n and are debating the implications of continuity and the behavior of the functions involved. There is an emphasis on finding a mathematical proof that does not rely on induction.
If I don't want to use induction but want to prove it mathematically ,how to do it ?0rthodontist said:You could use the fact that both functions are continuous and never cross after that point. If you are only interested in integer n then you could use induction.
?ngkamsengpeter said:If I don't want to use induction but want to prove it mathematically ,how to do it ?
Induction would be simpler for this case if you want to prove it for integers. The other way I mentioned is using the function [tex]f(x) = 2^x - x^2[/tex]. You should be able to show that [tex]f'(4) > 0[/tex] and also that [tex]f''(x) > 0[/tex] for any x larger than 4. And you know that f(4) = 0. Then usengkamsengpeter said:If I don't want to use induction but want to prove it mathematically ,how to do it ?