×
×

# Solved: deal with values of iterated functions. Suppose ISBN: 9780073383095 37

## Solution for problem 63E Chapter 5.3

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 1 365 Reviews
31
3
Problem 63E

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 ‒ a, where a is a positive integer. Find a formula for f(k)(n). What is the value of when n is a positive integer?

Step-by-Step Solution:
Step 1 of 3

Lecture 11- Plotting,Part 2 Thursday,October13,201612:07PM set Function One wayto customize your axes • • set(variable name for gca, 'what you're modifying ',...

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

Unlock Textbook Solution