Show that every sequence of n2 + 1 distinct real numbers contains a subsequence of length n + 1 that is either strictly increasing or strictly decreasing.
prove or disprove that every sequence of 9 distinct real numbers contains a subsequence of length 4 that is either strictly increasing or strictly decreasing.

the answer would be 150 books

step-by-step explanation:

if you divide 300 by 2 you will get 150

the formula for the equation of a circle is (x – h)2+ (y – k)2 = r2, where (h, k) represents the coordinates of the center of the circle, and r represents the radius of the circle. if a circle is tangent to the x-axis at (3,0), this means it touches the x-axis at that point.

x =-.20752

step-by-step explanation:

4^(x+2)=12

4^(x+2)=12

take the log base 4 on each side

log 4 (4^(x+2) = log 4(12)

we know log b(a^y) = y log b (a)

(x+2) log 4(4) = log 4 (12)

x+2 = log 4 (12)

we know   logb c = loga c/loga b

we want to convert to base 10   so a = 10

by default, we do not write the 10   c = 4   and b = 10

log4 10 = log 12/log 4

log4 10 = log 12/ log 4

x+2 = log 12/ log 4

subtract 2 from each side

x +2 -2 = log 12/ log 4 -2

x = 1.79248125 -2

x =-.20752