Determine for each one of the following functions if they are injective, surjective, neither, or bijective. Justify your answers sufficiently. (a) f : N → N, f (n) = n2 + 4. (b) g : N × N → N, g(m, n) = 2m · 3n. (c) h : Z → Z, h(n) = n + 5.
Added by Ines C.
Step 1
(a) f : N → N, f(n) = n² + 4 ** Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 97 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
For each of the following, determine (with proof) whether the function is injective and/or surjective. (a) Define f : Z → Z by f(n) = 2n + 1. (b) Define g : R → R by g(x) = x 2 + 2x + 2. (c) Define h: Z → Z by h(n) = n + 3.
Adi S.
5. In each case, determine if the given function is 1:1 (injective), onto (surjective), and/or bijective. Justify your answers. (a) f : Z+ → Z+ defined by f(n) = n! (b) g : R → Z defined by g(x) = ⌈ x ⌉ (c) h : R → R defined by h(x) = x / (1 + x^2)
Madhur L.
Classify each function as injective, surjective, or bijective. Justify your answer. (a) f : Z -> Z defined by f(n) = n - 2 (b) f : N -> Q defined by f(n) = 1/n
Sri K.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD