2. Consider the functions: • f : Z+ → Z+ defined via: f(n) = n¹ +1 • g : (Z+ − {1}) → Z+ defined via: g(n) is the smallest integer m s.t. m ≥ 2 and m❘n. For example: g(2) 9(35) = 5. = 2, g(3) = 3, g(6) = 2, g(7) = 7, g(8) == 2, g(9) = 3, (a) Compute is go f(2) and go f(3). There is no need to justify. (b) Is f one-to-one? Onto? Invertible? justify! (c) Is g one-to-one? Onto? Invertible? justify!

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter4: Polynomial And Rational Functions
Section4.6: Variation
Problem 7E
Question

please explain step by step, each concept in detail

2. Consider the functions:
• f : Z+ → Z+ defined via: f(n) = n¹ +1
• g : (Z+ − {1}) → Z+ defined via: g(n) is the smallest integer m s.t. m ≥ 2 and
m❘n. For example: g(2)
9(35) = 5.
= 2, g(3)
=
3, g(6)
=
2, g(7) = 7, g(8)
==
2, g(9) = 3,
(a) Compute is go f(2) and go f(3). There is no need to justify.
(b) Is f one-to-one? Onto? Invertible? justify!
(c) Is g one-to-one? Onto? Invertible? justify!
Transcribed Image Text:2. Consider the functions: • f : Z+ → Z+ defined via: f(n) = n¹ +1 • g : (Z+ − {1}) → Z+ defined via: g(n) is the smallest integer m s.t. m ≥ 2 and m❘n. For example: g(2) 9(35) = 5. = 2, g(3) = 3, g(6) = 2, g(7) = 7, g(8) == 2, g(9) = 3, (a) Compute is go f(2) and go f(3). There is no need to justify. (b) Is f one-to-one? Onto? Invertible? justify! (c) Is g one-to-one? Onto? Invertible? justify!
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell