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
7^2 - 3 + 9 x 8 / 2
49 - 3 + 9 x 8 / 2
49 - 3 + 72/2
49 - 3 + 36
46 + 36
82
w = 82
Answer:
108 deg
Step-by-step explanation:
Since sides DB and CD are congruent, then opposite angles are congruent.
m<C = m<B = 36
m<B + m<C + m<D = 180
36 + 36 + m<D = 180
m<D = 108
If your equation is 2v + 7 = 3,
Subtract 7 from both sides to get 2v = -4
Then divide 2 on both sides and get v = -4/2
Then simplify to get v = $-2
Divide to find out
4736/100 = 47.36
Therefore, we have to round, and then we get 47.
Answer: 47 groups and a remainder of 36.
