Since the solution to 64E from 5.3 chapter was answered, more than 246 students have viewed the full step-by-step answer. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. The answer to “deal with values of iterated functions. Suppose that f(n) is a function from the set of real numbers, or positive real numbers, or some other set of real numbers, to the set of real numbers such that f(n) is monotonically increasing [that is, f(n)<f(m) when n<m) and f(n)<n for all n in the domain of f.] The function f(k)(n) is defined recursively by Furthermore, let c be a positive real number. The iterated function is the number of iterations of f required to reduce its argument to c or less, so is the smallest nonnegative integer k such that fk(n) ? c.Let f(n) = n/2. Find a formula for f(k)(n). What is the value of when n is a positive integer?” is broken down into a number of easy to follow steps, and 121 words. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. This full solution covers the following key subjects: real, Numbers, set, function, Positive. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The full step-by-step solution to problem: 64E from chapter: 5.3 was answered by , our top Math solution expert on 06/21/17, 07:45AM.