4. Suppose f: Z-Z has the rule f(n)= 3n2-1. Determine whether f is one-to-one. 5. Suppose f: N-N has the rule f(n)= 4n2+1. Determine whether f is onto N.

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

4 & 5 ONLY.

4. Suppose f: Z-Z has the rule f(n)= 3n2-1. Determine whether f is one-to-one.
5. Suppose f: N-N has the rule f(n)= 4n2+1. Determine whether f is onto N.
6. Suppose f: R→R where f(x)=[x].
a. If S = {x|1 ≤x≤ 6), find f(S).
b. If T=(3,4,5), find f-1(T).
7. Suppose g: A→ B, and f: B→ C where A = {1, 2, 3, 4), B = {a,b,c}, C=(2, 8, 10), and g and fare
defined by g = {(1, b), (2, a), (3, b), (4, a)} and f = {(a, 8), (b, 10), (c, 2)}.
a. Find fog
b. Find f-1
c. Find fo f-1
Transcribed Image Text:4. Suppose f: Z-Z has the rule f(n)= 3n2-1. Determine whether f is one-to-one. 5. Suppose f: N-N has the rule f(n)= 4n2+1. Determine whether f is onto N. 6. Suppose f: R→R where f(x)=[x]. a. If S = {x|1 ≤x≤ 6), find f(S). b. If T=(3,4,5), find f-1(T). 7. Suppose g: A→ B, and f: B→ C where A = {1, 2, 3, 4), B = {a,b,c}, C=(2, 8, 10), and g and fare defined by g = {(1, b), (2, a), (3, b), (4, a)} and f = {(a, 8), (b, 10), (c, 2)}. a. Find fog b. Find f-1 c. Find fo f-1
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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,