Prove that the Greatest Integer Function f: R \(\to\) R given by f(x) = [x], is neither one-once nor onto, where [x] denotes the greatest integer less than or equal to x.
f: R \(\to\) R is given by,
f(x) = [x]
It is seen that f(1.2) = [1.2] = 1, f(1.9) = [1.9] = 1.
∴ f (1.2) = f(1.9), but 1.2 ≠ 1.9.
∴ f is not one-one.
Now, consider 0.7 ∈ R.
It is known that f(x) = [x] is always an integer. Thus, there does not exist any element x ∈ R such that f(x) = 0.7.
∴ f is not onto.
Hence, the greatest integer function is neither one-one nor onto.
A carpenter needs to make a wooden cuboidal box, closed from all sides, which has a square base and fixed volume. Since he is short of the paint required to paint the box on completion, he wants the surface area to be minimum.
On the basis of the above information, answer the following questions :
Find a relation between \( x \) and \( y \) such that the surface area \( S \) is minimum.
A school is organizing a debate competition with participants as speakers and judges. $ S = \{S_1, S_2, S_3, S_4\} $ where $ S = \{S_1, S_2, S_3, S_4\} $ represents the set of speakers. The judges are represented by the set: $ J = \{J_1, J_2, J_3\} $ where $ J = \{J_1, J_2, J_3\} $ represents the set of judges. Each speaker can be assigned only one judge. Let $ R $ be a relation from set $ S $ to $ J $ defined as: $ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} $.
During the festival season, a mela was organized by the Resident Welfare Association at a park near the society. The main attraction of the mela was a huge swing, which traced the path of a parabola given by the equation:\[ x^2 = y \quad \text{or} \quad f(x) = x^2 \]
Bittu and Chintu were partners in a firm sharing profit and losses in the ratio of 4 : 3. Their Balance Sheet as at 31st March, 2024 was as follows:
On 1st April, 2024, Diya was admitted in the firm for \( \frac{1}{7} \)th share in the profits on the following terms:
Prepare Revaluation Account and Partners' Capital Accounts.
A function is said to be one to one function when f: A → B is One to One if for each element of A there is a distinct element of B.
A function which maps two or more elements of A to the same element of set B is said to be many to one function. Two or more elements of A have the same image in B.
If there exists a function for which every element of set B there is (are) pre-image(s) in set A, it is Onto Function.
A function, f is One – One and Onto or Bijective if the function f is both One to One and Onto function.
Read More: Types of Functions