Answer: n = -25
Step-by-step explanation:
you would need to get N by itself so you would subtract 2n from both sides and that would bring you to n+75=50 and then you would need to subtract 75 from both sides and that leads you to n=-25
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
Similar polygons are made through scaling either by stretching or squeezing the sides all by a common ratio. Here, the size changes. Congruent polygons are made by shifting or reflecting their position. Here, the size does not change.
Choice A has a dilution (or squeezing) and a translation (shifting). That makes similar polygons.
Choice B has a rotation. Nope.
Choice C has a shifting and a reflection. Nope.
Choice D has a rotation and shifting. Nope.
Thus choice A is best.
The answer is;
The graph has a dotted line and is shaded below.
