Consider the recursion X(n) = 2X(n-1) + 2 with the initial condition that of X(1) = 4. Using math induction prove that a closed-form solution to this recurrence is X(n)=2n +2n+1 – 2.

Correct answer brainliest asap an d 99 pointsss what are relative frequencies to the nearest hundredth of the columns of two way table column a 102, 18 colunm b 34, 14 answers choices 0.15 0.25 0.29 0.44 0.56 0.71 0.75 0.85

[15 points]find the quotient with the restrictions. (x^2 - 2x - 3) (x^2 + 4x + 3) ÷ (x^2 + 2x - 8) (x^2 + 6x + 8)

The weight of 46 new patients of a clinic from the year 2018 are recorded and listed below. construct a frequency distribution, using 7 classes. then, draw a histogram, a frequency polygon, and an ogive for the data, using the relative information from the frequency table for each of the graphs. describe the shape of the histogram. data set: 130 192 145 97 100 122 210 132 107 95 210 128 193 208 118 196 130 178 187 240 90 126 98 194 115 212 110 225 187 133 220 218 110 104 201 120 183 124 261 270 108 160 203 210 191 180 1) complete the frequency distribution table below (add as many rows as needed): - class limits - class boundaries - midpoint - frequency - cumulative frequency 2) histogram 3) frequency polygon 4) ogive