Answer: Suppose that the function f satisfies the
Chapter 7, Problem 7.3.21(choose chapter or problem)
Suppose that the function f satisfies the recurrence relation fen) = 2f(Jn) + 1 whenever n is a perfect square greater than 1 and f(2) = 1. a) Find f(16). b) Find a big-O estimate for f(n). [Hint: Make the substitution m = log n.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer