subject
Mathematics, 12.03.2021 04:30 Jduxn

G(n) = 1 + 5(n - 1)
Complete the recursive formula of g(n).
g(1) =
g(n) = g(n-1)+​


G(n) = 1 + 5(n - 1)Complete the recursive formula of g(n).g(1) =g(n) = g(n-1)+​

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 22:10
What is the factor form of x^2-9x+14
Answers: 2
question
Mathematics, 21.06.2019 23:20
Triangle xyz, with vertices x(-2, 0), y(-2, -1), and z(-5, -2), undergoes a transformation to form triangle x? y? z? , with vertices x? (4, -2), y? (4, -3), and z? (1, -4). the type of transformation that triangle xyz undergoes is a . triangle x? y? z? then undergoes a transformation to form triangle x? y? z? , with vertices x? (4, 2), y? (4, 3), and z? (1, 4). the type of transformation that triangle x? y? z? undergoes is a .
Answers: 2
question
Mathematics, 21.06.2019 23:40
Mikes car gets an average of 28 mpg. there are 12 gallons of fuel in mikes car when he starts his trip of 140 miles. about how many gallons are left at the end of his trip?
Answers: 1
question
Mathematics, 22.06.2019 05:00
5,678.321 what place value is the 1 in
Answers: 2
You know the right answer?
G(n) = 1 + 5(n - 1)
Complete the recursive formula of g(n).
g(1) =
g(n) = g(n-1)+​
Questions
question
Mathematics, 20.10.2020 16:01
question
Health, 20.10.2020 16:01