The function g : R → R satisfies g(g(x)) + 2g(x) = 2x. Is g injective? Why? Find all values of x such that g(g(x)) = 0. Hint: Use definitions and do not try to think of a function g that fits the condition given. (not part of the question but please try to type it out if you can ty) (this is discrete math)
Added by Susan M.
Step 1
Step 1: To determine if g is injective, we need to show that if g(a) = g(b), then a = b for all a, b in the domain of g. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Vincenzo Zaccaro and 73 other Algebra 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
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.
Let g: R - {1} → R - {1} be defined by g(x). Prove that g is bijective.
Let $g: mathbb{Z} imes mathbb{Z} o mathbb{Z} imes mathbb{Z}$ be defined by $(a, b) mapsto (a + b, a + 2b)$. Prove that $g$ is injective and surjective.
Adi S.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD