The function ; defined by the highest prime factor of , is :
where = highest prime factor of .
One-one? No. and . Different inputs give the same output.
Onto? We need every natural number to be a highest prime factor of some . But is always a prime number, so (non-primes) are never in the range. So not onto.
The function is neither one-one nor onto. The answer corresponds to Option (4).
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.