Find the LCD (least common denominator) of the pair of fractions. Do not combine the fractions; only find the LCD.
1 answer:
You might be interested in
Answer:
D. in
Step-by-step explanation:
Hope this helps!
The base case is the claim that
which reduces to
which is true.
Assume that the inequality holds for <em>n</em> = <em>k </em>; that
We want to show if this is true, then the equality also holds for <em>n</em> = <em>k</em> + 1 ; that
By the induction hypothesis,
Now compare this to the upper bound we seek:
because
in turn because