Algebra proof question
Favorites|Homepage
Subscriptions | sitemap
HOME > Mathematics > Algebra proof question

Algebra proof question

[From: ] [author: ] [Date: 11-05-14] [Hit: ]
To do this we can write a = br for some r > 1. Then a^n = (br)^n = (b^n)(r^n). Substituting this into the inequality above, we wish to show there exists N such that (b^n)(r^n) > 2b^n for every n >= N. Dividing through by b^n, this is true if and only if there exists N such that r^n > 2 for every n >= N.......
Let a,b,c be given real numbers such that a > b > c >0. Prove that there exists a number N such that:
a^n > b^n + c^n for every n>= N

-
Ok so the right hand side, b^n+c^n, is less than b^n+b^n = 2b^n since c^n < b^n for any positive n. That said all we have to do is show there exists a number N such that a^n > 2b^n for every n >= N. To do this we can write a = br for some r > 1. Then a^n = (br)^n = (b^n)(r^n). Substituting this into the inequality above, we wish to show there exists N such that (b^n)(r^n) > 2b^n for every n >= N. Dividing through by b^n, this is true if and only if there exists N such that r^n > 2 for every n >= N. At this point all that's left is to show r^n > 2 for sufficiently large n, which is true and can be proven, but I think I'll stop here.

-
That looks like Fermat's Last Theorem.

http://en.wikipedia.org/wiki/Fermat%27s_…

-
sdfsfdsaf
1
keywords: proof,Algebra,question,Algebra proof question
New
Hot
© 2008-2010 http://www.science-mathematics.com . Program by zplan cms. Theme by wukong .