The function defined by , where is the set of natural numbers and denotes the greatest integer less than or equal to , is:
Let be any natural number. Divide by using the usual division algorithm.
There exist unique integers and such that
where and the remainder satisfies Explicitly,
Substituting into the definition of the function gives
Thus every natural number is sent to its remainder upon division by and so
To test injectivity (one-one), take two natural numbers that leave the same remainder when divided by For instance, choose and Both satisfy
Since but the function fails the injectivity criterion. Hence is not one-one.
To test surjectivity (onto) with respect to the stated codomain (the set of all integers), observe that
An integer such as lies in but never appears as an output, because every value of is at most Therefore the function is not onto.
Because is neither one-one nor onto, the correct choice is the one that says “neither one-one nor onto.”
Hence, the correct answer is Option C.
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.