Suppose you draw n lines in the plane so that every pair of lines cross (no lines are parallel) and no three lines cross at the same point. this will create some number of regions in the plane, including some unbounded regions. call the number of regions r n . rn. find a recursive formula for the number of regions created by n n lines, and justify why your recursion is correct.

answer:

3 bags of apples and 2 bags of oranges.

step-by-step explanation:

translate k to n and reflect across the line containing jk.

whole numbers.

step-by-step explanation:

we are given the average monthly rainfall (in millimeters) model r(m) for the years 1900-2009 as a function of the month number m.

as we can see m is taken for the number of months for years 1900-2009.

we know that number of months can't be a negative number or decimal number or a fraction.

so, the number of months could be only positive whole numbers.

therefore, whole numbers is more appropriate for the domain of r.

answer: y = -2.5x - 15

              (-6,0)

step-by-step explanation: