becca006
becca006 becca006
  • 24-04-2020
  • Mathematics
contestada

h(n) = –13n
Complete the recursive formula of h(n).
h(1) =
h(n)=h(n-1)+

Respuesta :

ajjacksonsanders ajjacksonsanders
  • 06-05-2020

Answer:

h(1)=−13

h(n)=h(n−1)+(−13)

Step-by-step explanation:

​

Answer Link
brittinnadeau brittinnadeau
  • 16-06-2020

Answer: h(1) =-21

h(n)=h(n-1)*(-1/3)

Step-by-step explanation:

Answer Link

Otras preguntas

Who could vote in the Pennsylvania colony
A box is known to hold exactly 250 cm3. Which side dimensions produce the most accurate measurement of the box?
What number should be added to the expression x^2+4x to change it into a perfect square trinomial? 1 2 4 8
A plane does not pass through a vertex of a tetrahedron. how many edges can it intersect?
Do i have to apply for college every year
Following the removal of the larynx, a person would be unable to A sneeze B eat C breathe D speak
Pls help me guys! You guys pls help me guys!
What is a graphics card and what does it do?
Which type of anatomic structure are wisdom teeth? vestigial homologous analogous heterologous
Y=sin(1/2x) what would this look like on a 2pi graph