4. Find an explicit injective map from $\mathbb{N} \times \mathbb{N} \to \mathbb{N}$.
Added by Kimberly R.
Close
Step 1
N x N is the set of all ordered pairs of natural numbers, and N is the set of all natural numbers. Show more…
Show all steps
Your feedback will help us improve your experience
Likhit Ganedi and 58 other Calculus 3 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
4. A function f : Z → Z x Z is defined as f(n) = (2n, n + 3). Verify whether this function is injective and whether it is surjective. 5. A function f : Z → Z is defined as f(n) = 2n + 1. Verify whether this function is injective and whether it is surjective. 6. A function f : Z x Z → Z is defined as f(m, n) = 3n - 4m. Verify whether this function is injective and whether it is surjective.
Diogo C.
Let n be a positive integer and let f : 0..n → [0..n] be an injective function. Define the function g : [0..n] → Z as g(x) = n - (f(x))^2. Prove that g is also injective.
Vincenzo Z.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Watch the video solution with this free unlock.
EMAIL
PASSWORD