CUETMOCK
  • Pricing
  • Mentors
Log inStart freeStart free mocks→

First test, then trust

Try a free CUET mock test.

Join 5,00,000+ students who rehearsed exam day on the exact NTA screen before sitting CUET. On the web and on Android.

Start free mocks →Get the Android app
CUETMOCK

India's #1 CUET Mock Test Platform. Original NCERT-based questions on the exact NTA exam screen — trusted by 5,00,000+ students since CUET 2022.

Get it onGoogle PlayScan to download the CUETMOCK app

Mock tests

  • CUET mock test series
  • Browse all papers
  • Commerce mocks
  • Humanities (Arts) mocks
  • Science mocks
  • Languages & GAT mocks
  • Free practice questions
  • Pricing

Resources

  • CUET exam guide
  • CUET syllabus
  • Universities accepting CUET
  • Expert blogs
  • News & notifications
  • Webinars & counselling
  • CUET score calculator
  • How we estimate your rank
  • FAQs

Company

  • About us
  • Our leadership & team
  • Our toppers
  • Mentors
  • For schools
  • Contact us
  • Terms
  • Privacy
  • Refund policy

Talk to us

+91 7696 6630 56info@cuetmock.comWhatsApp us

Our other platforms

  • JEE Mock — For IIT-JEE aspirants
  • NEET Mock — For NEET aspirants

Newsletter

Exam updates, study material and offers — no spam.

© 2026 NYC Ventures Pvt. Ltd.

701-702, Royal Business Park, Zirakpur, Punjab - 140603

  • Terms of use
  • Privacy policy
  • Refund policy
  • Contact us

iCUETMOCK is an independent preparation platform, not affiliated with the National Testing Agency (NTA). Always check exam details on the official NTA website.

  • Home
  • Mock tests
  • CUET guide
  • Pricing
  • Log in
Home/Practice questions/Maths. Section B1
Maths. Section B1Relations and Functions

The number of all onto functions from the set 1, 2, …, n to itself is

The number of all onto functions from the set \(\{1, 2, \ldots, n\}\) to itself is

Answer & explanation+

Correct answer: option 3

The correct answer is Option (3) → n!

For a function from a finite set to itself, onto and one-one go together: if all n elements are images, the n elements of the domain must go to n different images. So an onto function here is a one-one correspondence (a bijection).

Counting the bijections:

    1 can go to any of n elements
    2 can go to any of the remaining n − 1 elements
    and so on, down to 1 choice for n

    \(\text{Number} = n(n-1)(n-2)\cdots 1 = n!\)

NCERT (2026-27 edition):
Relations and Functions

NCERT extract

Advertisement

Practise more on Relations and Functions

Chapter-wise mocks on the real NTA exam screen, with solutions and your rank. Your first mocks are free.

Start free mocks →

Advertisement

Next questions

  1. Match List-I (Term) with List-II (Meaning).List-IList-II(A) Satra(I) Prayer halls(B) Naam ghar(II) Recitation of the names of the lord(C) S…History · Medieval India: Bhakti Sufi Traditions
  2. Which of the following is not the subject-matter of 'The Fifth Report', submitted to the British Parliament in 1813?History · Modern India: Colonialism and the Countryside
  3. Select the correct formula for the coordination compound "Dichloridobis (ethane-1,2-diamine) cobalt(III) chloride"Chemistry · Inorganic: Coordination Compounds
  4. Biopiracy is associated with which of the following?Biology · Biotechnology and its Applications
  5. Select the set of classes, the relationship among which is best illustrated by the following.General Aptitude Test · Verbal Reasoning
  6. ∫ frac≤ft(x^4-x)^1/4x^5 d x is equal toMaths. Section B1 · Indefinite Integration
  7. Which of the following is NOT a chemical coagulant used in water treatment?General Aptitude Test · General Knowledge
  8. In the question given below there are 2 statements marked as Assertion (A) and Reason (R). Choose the correct alternative from the followin…Economics · Macro Economics: Government Budget and Economy
  9. What is the mirror image of the given figure?General Aptitude Test · Non-Verbal Reasoning
  10. Select the correct passive form of the given sentence. Buy some apples and grapes for the family.English · Grammar: Active Passive Voice