toughcookie723
New member
- Joined
- Oct 6, 2011
- Messages
- 11
Consider the Expression K^n/n!, where k is a positive real number and n! is the product of whole numbers from 1 to n.
PART A
Prove: For any value of k, there is a value of n for which k^n/n! > k^(n+1)/ (n+1)!
(So the premise is then : if n+1>k, then k^n/n! > k^(n+1)/ (n+1)!)
By induction, if n=2, then
1^2/2*1> 1^3/3*2*1
If true for n=m, then true for n=m+1
k^m/m! > k^(m+1)/(m+1)!
(k/m+1)* k^m/m! > k^(m+1)/(m+1)!* (k/m+1)
k^(m+1)/(m+1)! > k^(m+1)/(m+1)!* k/m+1
k^(m+1)/(m+1)! > k^(m+1)/(m+1)!* k/(m+1+1-1)
k^(m+1)/(m+1)! > k^(m+1)/(m+1)!* k/(m+2-1)
(and here I am stuck. I know I am supposed to end up at k^(m+1)/(m+1)! > k^(m+2)/(m+2)!)
Part B
Let H= {k^n/n!: n is a whole number}. Prove: H has a largest element.
You may assume that any finite set of real numbers has a greatest term (but note that H is not a finite set). Hint: Part (a) is the first step in the induction proof. What’s the rest of the induction proof and what’s the induction proof proving?).
-This I am totally lost in. I understand that when it says any finite set of real numbers has a greatest term refers to the set of n numbers. And since there is a finite set of n numbers and it has a largest element then H must have the largest element? Really no clue where to start or where I should arrive at if the premise of the proof is part (a).
HELP, Please!!!
PART A
Prove: For any value of k, there is a value of n for which k^n/n! > k^(n+1)/ (n+1)!
(So the premise is then : if n+1>k, then k^n/n! > k^(n+1)/ (n+1)!)
By induction, if n=2, then
1^2/2*1> 1^3/3*2*1
If true for n=m, then true for n=m+1
k^m/m! > k^(m+1)/(m+1)!
(k/m+1)* k^m/m! > k^(m+1)/(m+1)!* (k/m+1)
k^(m+1)/(m+1)! > k^(m+1)/(m+1)!* k/m+1
k^(m+1)/(m+1)! > k^(m+1)/(m+1)!* k/(m+1+1-1)
k^(m+1)/(m+1)! > k^(m+1)/(m+1)!* k/(m+2-1)
(and here I am stuck. I know I am supposed to end up at k^(m+1)/(m+1)! > k^(m+2)/(m+2)!)
Part B
Let H= {k^n/n!: n is a whole number}. Prove: H has a largest element.
You may assume that any finite set of real numbers has a greatest term (but note that H is not a finite set). Hint: Part (a) is the first step in the induction proof. What’s the rest of the induction proof and what’s the induction proof proving?).
-This I am totally lost in. I understand that when it says any finite set of real numbers has a greatest term refers to the set of n numbers. And since there is a finite set of n numbers and it has a largest element then H must have the largest element? Really no clue where to start or where I should arrive at if the premise of the proof is part (a).
HELP, Please!!!