subject
Mathematics, 02.03.2020 21:05 bbyjean9214

Consider the function g on {2 k | k ∈ IN} defined recursively by g(1) = 1 and g(n) = 3g(n/2) + 4 for n ≥ 2. Find a formula for g(n) and prove that your formula is correct.

ansver
Answers: 3

Other questions on the subject: Mathematics

image
Mathematics, 21.06.2019 19:20, Kimb9820
Which letters from the table represent like terms? a and b b and c a and d b and d
Answers: 3
image
Mathematics, 21.06.2019 20:30, becca2327
Tom is the deli manager at a grocery store. he needs to schedule employee to staff the deli department for no more that 260 person-hours per week. tom has one part-time employee who works 20 person-hours per week. each full-time employee works 40 person-hours per week. write and inequality to determine n, the number of full-time employees tom may schedule, so that his employees work on more than 260 person-hours per week. graph the solution set to this inequality.
Answers: 2
image
Mathematics, 21.06.2019 21:30, thompsonmark0616
Find the domain and range of the following function f(x) = 51x - 21+ 4
Answers: 2
image
Mathematics, 21.06.2019 22:00, lkarroum3733
1) prove that 731^3−631^3 is divisible by 100 2) prove that 99^3−74^3 is divisible by 25
Answers: 2
You know the right answer?
Consider the function g on {2 k | k ∈ IN} defined recursively by g(1) = 1 and g(n) = 3g(n/2) + 4 for...

Questions in other subjects: