MCQEasyJEE 2024Functions

JEE Mathematics 2024 Question with Solution

The function f:N{1}Nf: \mathbb{N} - \{1\} \to \mathbb{N} defined by f(n)=f(n) = highest prime factor of nn, is:

  • A

    one-one and onto

  • B

    one-one only

  • C

    onto only

  • D

    neither one-one nor onto

Answer

Correct answer:D

Step-by-step solution

Standard Method

Given: The function is f:N{1}Nf: \mathbb{N} - \{1\} \to \mathbb{N} where f(n)f(n) is the highest prime factor of nn.

Find: Whether the function is one-one, onto, both, or neither.

To test whether ff is one-one, consider two different inputs:

f(6)=3,f(9)=3f(6) = 3, \qquad f(9) = 3

Both 66 and 99 have the same image 33. Therefore, different elements of the domain map to the same value, so ff is not one-one.

To test whether ff is onto, note that the codomain is N\mathbb{N}, but the output of f(n)f(n) is always a prime number because it is the highest prime factor of nn.

Hence a natural number such as 44 cannot be the image of any nn, since 44 is not prime. So every element of N\mathbb{N} is not attained. Therefore, ff is not onto.

Therefore, the function is neither one-one nor onto. The correct option is D.

Step-by-Step Check

Given: f(n)f(n) returns the highest prime factor of nn for nN{1}n \in \mathbb{N} - \{1\}.

Find: The nature of the function.

Examples from the definition:

f(10)=5,f(15)=5,f(18)=3f(10) = 5, \qquad f(15) = 5, \qquad f(18) = 3

These show that the output is always a prime number.

For injectivity, if the function were one-one, distinct inputs would have distinct outputs. But

f(10)=f(15)=5f(10) = f(15) = 5

so ff is not injective.

For surjectivity, every element of N\mathbb{N} should appear as an output. Since only prime numbers can occur as values of f(n)f(n), composite numbers such as 44 are never attained. Thus ff is not surjective.

So the function is neither one-one nor onto, hence the correct option is D.

Common mistakes

  • Assuming the function is one-one because each number has a unique highest prime factor. This is wrong because one-one concerns distinct inputs having distinct outputs. Different numbers such as 66 and 99 can have the same highest prime factor. Check images of different inputs, not uniqueness of factorization.

  • Assuming the function is onto because every prime number appears as an output. This is wrong because the codomain is N\mathbb{N}, not the set of primes. To test onto, every natural number must be attained; composite numbers like 44 are not outputs.

  • Confusing the domain and codomain while testing surjectivity. The domain is N{1}\mathbb{N} - \{1\}, but onto must be checked against the codomain N\mathbb{N}. Always compare the range with the codomain, not with the domain.

Practice more Functions questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions