. Exercise 4.12. The Fibonacci numbers are defined recursively by F1 = 1, F2 = 1, and for n ≥ 3, Fn = Fn−1 + Fn−2. Prove that the Fibonacci numbers are given by the equation Fn = (1 + √ 5)n − (1 − √ 5)n 2 n √ 5

since proposition states that a number is greater than 25, if is true then the number must actually be greater than 25.

this implies that all possible options, except 24, can be accepted

first one is a: renaming a fraction. second one is c: de-c

step-by-step explanation:

my explanation is that these were the answers on edg : )

step-by-step explanation:

we are given a graph for system of inequalities.

in order to write the system of inequalities for the given graph, we need to find the inequality for each of the line separately.

let us find the slope of dotted line first.

taking two coordinates on the graph.

let us say (0,0) and (3,1).

let us find the slope of the line now.

slope of the dotted line would be =.

y-intercept of dotted line is y=0 only.

plugging slope m= and b=0 in slope-intercept form y=mx+b, we get

.

the line is shaded up of that dotted line.

therefore, for shading up we would take greater than inequality symbol > .

and because it's a dotted line we would take only > symbol in place of = sign in above equation of line.

therefore, inequality for dotted line would be

let us take two points (3,1) and (0,4) on the solid line.

slope of the solid line would be =.

for the solid line we have y-intercept b= 4.

plugging slope m= -1 and b=4 in slope-intercept form y=mx+b, we get

y = -1x + 4.

the line is shaded down of that solid line.

therefore, for shading down we would take less than inequality symbol < .

and because it's a solid line we would take ≤ symbol in place of = sign in above equation of line.

therefore, inequality for solid line would be