Question:

the distinct linear funtions which map[-1,1] onto[0,2] are _______

Updated On: Jun 13, 2025
  • f(n)=-x-1,g(x)=x-1
  • f(x)=-x-1,g(x)=x+1
  • f(x)=-x-1,g(x)=x+1
  • f(x)=-x+1,g(x)=x+1
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

To find the distinct linear functions that map the interval \([-1,1]\) onto \([0,2]\), we need to consider the general form of a linear function which is \(f(x) = ax + b\). For the function to map \([-1,1]\) to \([0,2]\), the endpoints of the domain must map to the endpoints of the range:

  1. At \(x = -1\), \(f(x)\) should equal 0: \(a(-1) + b = 0\rightarrow -a + b = 0\rightarrow b = a\).
  2. At \(x = 1\), \(f(x)\) should equal 2: \(a(1) + b = 2\rightarrow a + b = 2\).

We have a system of equations:

(1) \(b = a\)
(2) \(a + b = 2\)

Substituting \((1)\) into \((2)\):

  • \(a + a = 2\rightarrow 2a = 2\rightarrow a = 1\)
  • Therefore, \(b = 1\) from \((1)\).

This gives the linear function \(f(x) = x + 1\). To find the second function, consider reflection over the x-axis to maintain linearity and distinct mapping. Hence, we try \(f(x) = -x + 1\). Both functions \(f(x) = -x + 1\) and \(g(x) = x + 1\) satisfy the condition of distinct mappings and linear properties. 

Therefore, the functions are: \(f(x) = -x + 1, g(x) = x + 1\).

Was this answer helpful?
2
0

Concepts Used:

Functions

A function is a relation between a set of inputs and a set of permissible outputs with the property that each input is related to exactly one output. Let A & B be any two non-empty sets, mapping from A to B will be a function only when every element in set A has one end only one image in set B.

Kinds of Functions

The different types of functions are - 

One to One Function: When elements of set A have a separate component of set B, we can determine that it is a one-to-one function. Besides, you can also call it injective.

Many to One Function: As the name suggests, here more than two elements in set A are mapped with one element in set B.

Moreover, if it happens that all the elements in set B have pre-images in set A, it is called an onto function or surjective function.

Also, if a function is both one-to-one and onto function, it is known as a bijective. This means, that all the elements of A are mapped with separate elements in B, and A holds a pre-image of elements of B.

Read More: Relations and Functions