The Fibonacci numbers are the numbers \[ 1,1,2,3,5,8,13,21,34\ldots \] where the first two numbers are 1 and 1, and each number after that is the sum of the two previous numbers. (So $2 = 1+1$, $3 = 2+1$, and so on.) Write an algorithm, in English, that takes a positive integer $n$ as input and then outputs the $n$th Fibonacci number. For example, if we input to the algorithm $n=2,$ your algorithm should output 1. If we input $n=6,$ your algorithm should output 8. Remember that an algorithm should consist of a series of unambiguous steps. Use variable names to identify what values you are referring to. You can assume that the computer can do basic arithmetic.

c is the answer

step-by-step explanation:

x ≥ 18 is your answer

step-by-step explanation:

let "a number" = x

(2/3)x + 17 ≥ 29

isolate the variable (x). do the opposite of pemdas (parenthesis, exponent (& root), multiplication, division, addition, subtraction).

first, subtract 17 from both sides.

(2/3)x + 17 (-17) ≥ 29 (-17)

(2/3)x ≥ 29 - 17

(2/3)x ≥ 12

next, multiply 3/2 to both sides to isolate the x

(3/2)(2/3)x ≥ 12(3/2)

x ≥ 12(3/2)

simplify. multiply, then divide

x ≥ (12 * 3)/2

x ≥ (36)/2

x ≥ 18

x ≥ 18 is your answer

~

2.2°  

step-by-step explanation:

let θ = the angle of elevation.

tanθ =77/2020

tanθ = 0.038 12

      θ = tan⁻¹0.038 12

      θ = 2.2°

jeff jeff

step-by-step explanation: