11. Suppose f NN satisfies the recurrence relation f(n) if f(n) is even 3f(n)1 if f(n) is odd f(n1) 2 Note that with the initial condition f(0) 1, the values of the function are: f(1) 4 f(2)2. f(3) 1. f(4) 4 and so on, the images cycling through those three numbers. Thus f is NOT injective (and also certainly not surjective). Might it be under other initial conditions? 3 If f satisfies the initial condition f(0) 5, is finjective? Explain why or give a specific example of two elements from the domain with the same image. b. If f satisfies the initial condition f(0) 3, is f injective? Explain why or give a specific example of two elements from the domain with the same image. c. If f satisfies the initial condition f(0) 27, then it turns out that f(105) 10 and no two numbers less than 105 have the same image. Could f be injective? Explain. d. Prove that no matter what initial condition you choose, the function cannot be surjective.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
11. Suppose f NN satisfies the recurrence relation
f(n)
if f(n) is even
3f(n)1 if f(n) is odd
f(n1)
2
Note that with the initial condition f(0) 1, the values of the function are:
f(1) 4 f(2)2. f(3) 1. f(4) 4 and so on, the images cycling through
those three numbers. Thus f is NOT injective (and also certainly not surjective).
Might it be under other initial conditions? 3
If f satisfies the initial condition f(0) 5, is finjective? Explain why or
give a specific example of two elements from the domain with the same
image.
b. If f satisfies the initial condition f(0) 3, is f injective? Explain why or
give a specific example of two elements from the domain with the same
image.
c. If f satisfies the initial condition f(0) 27, then it turns out that
f(105) 10 and no two numbers less than 105 have the same image.
Could f be injective? Explain.
d. Prove that no matter what initial condition you choose, the function
cannot be surjective.
Transcribed Image Text:11. Suppose f NN satisfies the recurrence relation f(n) if f(n) is even 3f(n)1 if f(n) is odd f(n1) 2 Note that with the initial condition f(0) 1, the values of the function are: f(1) 4 f(2)2. f(3) 1. f(4) 4 and so on, the images cycling through those three numbers. Thus f is NOT injective (and also certainly not surjective). Might it be under other initial conditions? 3 If f satisfies the initial condition f(0) 5, is finjective? Explain why or give a specific example of two elements from the domain with the same image. b. If f satisfies the initial condition f(0) 3, is f injective? Explain why or give a specific example of two elements from the domain with the same image. c. If f satisfies the initial condition f(0) 27, then it turns out that f(105) 10 and no two numbers less than 105 have the same image. Could f be injective? Explain. d. Prove that no matter what initial condition you choose, the function cannot be surjective.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 5 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,