Advertisements
Advertisements
Question
The function f(x) = [x], where [x] denotes the greatest integer less than or equal to x; is continuous at ______.
Options
x = 1
x = 1.5
x = – 2
x = 1
Advertisements
Solution
The function f(x) = [x], where [x] denotes the greatest integer less than or equal to x; is continuous at x = 1.5.
Explanation:
We know that the biggest integer function is continuous only on non-integral points, not on integers.
APPEARS IN
RELATED QUESTIONS
Check the injectivity and surjectivity of the following function:
f : N → N given by f(x) = x2
Classify the following function as injection, surjection or bijection :
f : Q → Q, defined by f(x) = x3 + 1
Show that if f1 and f2 are one-one maps from R to R, then the product f1 × f2 : R → R defined by (f1 × f2) (x) = f1 (x) f2 (x) need not be one - one.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x2 + 8 and g(x) = 3x3 + 1 .
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x and g(x) = |x| .
If f(x) = sin x and g(x) = 2x be two real functions, then describe gof and fog. Are these equal functions?
if f (x) = `sqrt (x +3) and g (x) = x ^2 + 1` be two real functions, then find fog and gof.
Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.
Consider the function f : R+ → [-9 , ∞ ]given by f(x) = 5x2 + 6x - 9. Prove that f is invertible with f -1 (y) = `(sqrt(54 + 5y) -3)/5` [CBSE 2015]
Let A and B be two sets, each with a finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.
If A = {1, 2, 3} and B = {a, b}, write the total number of functions from A to B.
If A = {a, b, c} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.
Let f : R → R, g : R → R be two functions defined by f(x) = x2 + x + 1 and g(x) = 1 − x2. Write fog (−2).
What is the range of the function
`f (x) = ([x - 1])/(x -1) ?`
Let f, g : R → R be defined by f(x) = 2x + l and g(x) = x2−2 for all x
∈ R, respectively. Then, find gof. [NCERT EXEMPLAR]
The function \[f : [0, \infty ) \to \text {R given by } f\left( x \right) = \frac{x}{x + 1} is\]
A function f from the set of natural numbers to integers defined by
`{([n-1]/2," when n is odd" is ),(-n/2,when n is even ) :}`
Let f be an injective map with domain {x, y, z} 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
Let
\[f : R \to R\] be a function defined by
\[f : Z \to Z\] be given by
` f (x) = {(x/2, ", if x is even" ) ,(0 , ", if x is odd "):}`
Then, f is
If \[f : R \to \left( - 1, 1 \right)\] is defined by
\[f\left( x \right) = \frac{- x|x|}{1 + x^2}, \text{ then } f^{- 1} \left( x \right)\] equals
Mark the correct alternative in the following question:
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is
Let f: R → R be the function defined by f(x) = 4x – 3 ∀ x ∈ R. Then write f–1
Let f: R → R be the functions defined by f(x) = x3 + 5. Then f–1(x) is ______.
Let A = {0, 1} and N be the set of natural numbers. Then the mapping f: N → A defined by f(2n – 1) = 0, f(2n) = 1, ∀ n ∈ N, is onto.
An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
- Ravi wants to know among those relations, how many functions can be formed from B to G?
An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
- Ravi wants to find the number of injective functions from B to G. How many numbers of injective functions are possible?
Let f: R→R be defined as f(x) = 2x – 1 and g: R – {1}→R be defined as g(x) = `(x - 1/2)/(x - 1)`. Then the composition function f (g(x)) is ______.
