Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1) Let g : A B and f : B C be two functions. Prove or disprove the followings: (a) if f and g are

1) Let g : A B and f : B C be two functions. Prove or disprove the followings: (a) if f and g are surjective, then (f g) is surjective. (b) if f and g are injective, then (f g) is injective.

2) For each of the following functions from real numbers to real numbers prove or disprove the following: The function is injective. The function is surjective. The function is bijective. If function is a bijection, then find its inverse. (a) f (x) = 2bxc + 1 (b) f (x) = 10x + 7 (c) f (x) = |6x + 3| (d) f (x) = 5x2 1 (e) f (x) = 2x5 3

3) 10pts) Find the range of these functions. Give your answer as a simple/short sentence using plain English. The following solution to (a): S = {2x | x Z} despite being correct, will receive 0 points. Recall that N is the set of all natural numbers numbers {0, 1, 2, 3, . . .}, and Z+ is the set of positive integers {1, 2, 3, . . .}. (a) f : Z R, f (x) = 2x. (b) f : N R, f (x) = 2x. (c) f : R R, f (x) = 2x. (d) f : N R, f (x) = last digit of 2x. (e) f : N Z+ R, f (x, y) = x/y. Remember to simplify your answer. For example, the answer {x/y|x N, y Z+} to part (d), despite being correct will get 0 marks.

4) Determine whether f is a function or not. Justify your answer. Recall, that R is the set of all real numbers, Z is the set of all integers. (a) f : R R, f (x) = 1/x. (b) f : Z R, f (x) = x2 + 3. (c) f : R R, f (x) = x + 5. (d) f : Z R, f (x) = x2. (e) f : R Z, f (x) = dxe.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Concepts

Authors: David M. Kroenke, David J. Auer

7th edition

133544621, 133544626, 0-13-354462-1, 978-0133544626

More Books

Students also viewed these Databases questions