shakalandro
New member
- Joined
- Nov 29, 2008
- Messages
- 36
I have this problem where I need to prove inductively the problem attached for positive integers n and positive real numbers x[sub:148855tf]i[/sub:148855tf].
The problem also says that "It does not seem to be possible to give a direct proof of this result using induction on n, however it can be proved for n = 2[sup:148855tf]m[/sup:148855tf] for m greater than or equal to 0 by induction o m. The general result now follows by proving the converse of the usual inductive step: if the result holds for n = k +1, where k is a positive integer, then it hold for n = k."
I'm not even sure what the problem looks like once n is substituted out for 2[sup:148855tf]m[/sup:148855tf]. And what does x[sub:148855tf]i[/sub:148855tf] even mean in a product or summation?
The problem also says that "It does not seem to be possible to give a direct proof of this result using induction on n, however it can be proved for n = 2[sup:148855tf]m[/sup:148855tf] for m greater than or equal to 0 by induction o m. The general result now follows by proving the converse of the usual inductive step: if the result holds for n = k +1, where k is a positive integer, then it hold for n = k."
I'm not even sure what the problem looks like once n is substituted out for 2[sup:148855tf]m[/sup:148855tf]. And what does x[sub:148855tf]i[/sub:148855tf] even mean in a product or summation?