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

Another question on Mathematics

question
Mathematics, 21.06.2019 15:00
Use addition and subtraction to simplify the following polynomials. a. add polynomials: (3 – 4x + 8x^2) + (–6 + 2x – 5x^2) step 1: rewrite the polynomials without the parentheses. step 2: write the polynomial in descending order and use parentheses around like terms. step 3: add the like terms identified in step 2 to simplify the polynomial. b. subtract polynomials: (3x – 5 – 7x^2) – (–2 + 6x^2 – 5x) step 1: rewrite the polynomials without the parentheses. remember to multiply each term in the second parentheses by –1. show your work. step 2: write the polynomial in descending order and use parentheses around like terms. step 3: add the like terms identified in step 2 to simplify the polynomial.
Answers: 3
question
Mathematics, 21.06.2019 20:30
Solve each quadratic equation by factoring and using the zero product property. [tex]x^2+6x+8=0[/tex]
Answers: 2
question
Mathematics, 22.06.2019 03:40
(25 ! ) what does it mean for an equation to have no solution or infinitely many solutions?
Answers: 1
question
Mathematics, 22.06.2019 04:30
Acomputer company is testing a new booster to increase program load times. the box plots show the number of seconds it takes to load a program with and without the booster. using these plots, how much did the median change?
Answers: 1
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
question
Mathematics, 24.11.2020 19:10
question
Mathematics, 24.11.2020 19:20
question
Biology, 24.11.2020 19:20
question
Mathematics, 24.11.2020 19:20