25 points will mark brainlest as part of the save nature campaign the city Forest department has decided to grow more trees to kick off the campaign they start by planting 2 pine trees it has been decided that every year they will increase the amount of trees but 1 tree less than the square of the previous year's count which of the following recursives formulas can be used to determine the total number of tree planted in the future assume there is in limited space for trees and n is the number of years of the program's operation

N(n+1) = N(n)^2 - 1, n>=0, N(0) = 2

or equivalently

N(n) = N(n-1)^2 - 1, n>0, N(0) = 2

Step-by-step explanation:

Year 0 = 2 trees

year 1 = 2^2-1 = 3

year 2 = 3^2-1 =8

year 2 = 8^2-1 =63

...

Recursive formula

Let

n = integer year number

N(n) = number of trees to plant in year n

N(n+1) = N(n)^2-1, n>=0, N(0) = 2

or equivalently

N(n) = N(n-1)^2, n>0, N(0) = 2

Whats the options???

828. all there is to it!

here, if you ever need with rounding (or other forms of arithmetic/math) again, use this:

thats the rounding one, but if you just click the top left, it shows you all the calculators you may need!

walter needs to make at least 5 more cookies but no more than 40. 5 ≤ x ≤ 40

step-by-step explanation:

20 ≤ x + 15 ≤ 55

subtract 15 from all parts

20-15 ≤ x + 15-15 ≤ 55-15

5 ≤ x ≤ 40

this means how many more cookies he has to make

walter needs to make at least 5 more cookies, but no more than 40 cookies; 5 ≤ x ≤ 40