मराठी

Let f : N → N be defined by f(n) = {((n+1)/2, if n is odd),(n/2, if n is even):} for all n ∈ N. State whether the function f is bijective. Justify your answer.

Advertisements
Advertisements

प्रश्न

Let f : N → N be defined by f(n) = `{((n+1)/2", if n is odd"),(n/2", if n is even"):}` for all n ∈ N.

State whether the function f is bijective. Justify your answer.

औचित्य
बेरीज
Advertisements

उत्तर

f : N → N is defined as f(n) = `{((n + 1)/2",", "if n is odd"), (n/2",", "if n is even"):}` for all n ∈ N.

It can be observed that:

f(1) = `(1+1)/2` = 1 and f(2) = `2/2` = 1   ...[By definition of f]

∴ f(1) = f(2), where 1 ≠ 2

∴ f is not one-one.

Consider a natural number (n) in co-domain N.

Case I: n is odd

∴ n = 2r + 1 for some r ∈ NThen, there exists 4r + 1 ∈ N such that

f(4r + 1) = `(4r + 1 + 1)/2`

= 2r + 1

Case II: n is even

∴ n = 2r for some r ∈ NThen, there exists 4r ∈ N such that

f(4r) = `(4r)/2`

= 2r

∴ f is onto.

Hence, f is not a bijective function.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations and Functions - EXERCISE 1.2 [पृष्ठ ११]

APPEARS IN

एनसीईआरटी Mathematics Part 1 and 2 [English] Class 12
पाठ 1 Relations and Functions
EXERCISE 1.2 | Q 9. | पृष्ठ ११

व्हिडिओ ट्यूटोरियलVIEW ALL [5]

संबंधित प्रश्‍न

Let fR → be defined as f(x) = 10x + 7. Find the function gR → R such that g o f = f o = 1R.


Give examples of two functions fN → Z and gZ → Z such that g o f is injective but gis not injective.

(Hint: Consider f(x) = x and g(x) =|x|)


Let fR → R be the Signum Function defined as

f(x) = `{(1,x>0), (0, x =0),(-1, x< 0):}`

and gR → be the Greatest Integer Function given by g(x) = [x], where [x] is greatest integer less than or equal to x. Then does fog and gof coincide in (0, 1]?


Show that the function f: ℝ → ℝ defined by f(x) = `x/(x^2 + 1), ∀x in R`is neither one-one nor onto. Also, if g: ℝ → ℝ is defined as g(x) = 2x - 1. Find fog(x)


Give an example of a function which is neither one-one nor onto ?


Classify the following function as injection, surjection or bijection :  f : Z → Z given by f(x) = x2


Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.


Let f : R → R and g : R → R be defined by f(x) = + 1 and (x) = x − 1. Show that fog = gof = IR.


If f : A → B and g : B → C are onto functions, show that gof is a onto function.


Consider f : {1, 2, 3} → {abc} and g : {abc} → {apple, ball, cat} defined as f (1) = af (2) = bf (3) = cg (a) = apple, g (b) = ball and g (c) =  cat. Show that fg and gof are invertible. Find f−1g−1 and gof−1and show that (gof)−1 = f 1o g−1


If f : R → R be defined by f(x) = x3 −3, then prove that f−1 exists and find a formula for f−1. Hence, find f−1(24) and f−1 (5).


If A = {abc} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.


If f : R → R is defined by f(x) = x2, find f−1 (−25).


Let f : R → R be defined as  `f (x) = (2x - 3)/4.` write fo f-1 (1) .


Let f be an invertible real function. Write ( f-1  of ) (1) + ( f-1  of ) (2) +..... +( f-1 of ) (100 )


Let 

\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\} = B\] Then, the mapping\[f : A \to \text{B given by} f\left( x \right) = x\left| x \right|\] is 

 


Let f be an injective map with domain {xyz} and range {1, 2, 3}, such that exactly one of the following statements is correct and the remaining are false.

\[f\left( x \right) = 1, f\left( y \right) \neq 1, f\left( z \right) \neq 2 .\]

The value of

\[f^{- 1} \left( 1 \right)\] is 

 


The  function f : [-1/2, 1/2, 1/2] → [-π /2,π/2], defined by f (x) = `sin^-1` (3x - `4x^3`), is

 


Let

\[f : R - \left\{ n \right\} \to R\]

\[f\left( x \right) = \frac{x - m}{x - n}, \text{where} \ m \neq n .\] Then,
 

Let

\[f : R \to R\]
\[f\left( x \right) = \frac{x^2 - 8}{x^2 + 2}\]
Then,  f is


Let

\[f : [2, \infty ) \to X\] be defined by

\[f\left( x \right) = 4x - x^2\] Then, f is invertible if X =

 


Write about strlen() function.


Let f: R → R be the functions defined by f(x) = x3 + 5. Then f–1(x) is ______.


Let f: R → R be given by f(x) = tan x. Then f–1(1) is ______.


If f(x) = (4 – (x – 7)3}, then f–1(x) = ______.


Let f : R → R be a function defined by f(x) `= ("e"^abs"x" - "e"^-"x")/("e"^"x" + "e"^-"x")` then f(x) is


If `f : R -> R^+  U {0}` be defined by `f(x) = x^2, x ∈ R`. The mapping is


A function f: x → y is/are called onto (or surjective) if x under f.


'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:


Let n(A) = 4 and n(B) = 6, Then the number of one – one functions from 'A' to 'B' is:


Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R then 'f' is


If log102 = 0.3010.log103 = 0.4771 then the number of ciphers after decimal before a significant figure comes in `(5/3)^-100` is ______.


If f: [0, 1]→[0, 1] is defined by f(x) = `(x + 1)/4` and `d/(dx) underbrace(((fofof......of)(x)))_("n"  "times")""|_(x = 1/2) = 1/"m"^"n"`, m ∈ N, then the value of 'm' is ______.


Let f(n) = `[1/3 + (3n)/100]n`, where [n] denotes the greatest integer less than or equal to n. Then `sum_(n = 1)^56f(n)` is equal to ______.


Let f(x) be a polynomial of degree 3 such that f(k) = `-2/k` for k = 2, 3, 4, 5. Then the value of 52 – 10f(10) is equal to ______.


Let f(x) be a polynomial function of degree 6 such that `d/dx (f(x))` = (x – 1)3 (x – 3)2, then

Assertion (A): f(x) has a minimum at x = 1.

Reason (R): When `d/dx (f(x)) < 0, ∀  x ∈ (a - h, a)` and `d/dx (f(x)) > 0, ∀  x ∈ (a, a + h)`; where 'h' is an infinitesimally small positive quantity, then f(x) has a minimum at x = a, provided f(x) is continuous at x = a.


Many students choosing the same favourite subject resembles which type of function?


If every seat in a classroom is occupied by one student, the situation resembles:


Which condition represents a one-one (injective) function?


Which condition represents an onto (surjective) function?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×