Number of Onto (Surjective are Possible)

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/digital-logic-circuits-discrete-math-structures/functions/onto-surjective-function-definition-count-and-properties/asset-number-of-onto-surjective-are-possible after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture focuses on the mathematical concept of counting surjective (onto) functions between two finite sets. The instructor begins by defining the problem of finding the number of onto functions from set A to set B, denoting their cardinalities as $|A| = m$ and $|B| = n$. He introduces the general formula derived from the Principle of Inclusion-Exclusion, which is essential for solving such combinatorial problems. The lecture then transitions to a practical application using a specific question from the GATE 2015 exam, demonstrating how to apply the formula to find the number of onto functions from set $X = \{1, 2, 3, 4\}$ to set $Y = \{a, b, c\}$. The instructor walks through the substitution of values and the step-by-step arithmetic calculation to arrive at the final answer.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the topic by writing the question 'No of onto function possible from A to B = ?' on the screen. He defines the cardinality of the domain set A as $m$ and the codomain set B as $n$. He then displays the general formula for the number of onto functions: $n^m - {}^nC_1(n-1)^m + {}^nC_2(n-2)^m - {}^nC_3(n-3)^m + \dots + (-1)^n {}^nC_{n-1} 1^m$. This formula is presented as the standard method for calculating surjective functions when the size of the domain is greater than or equal to the size of the codomain.

  2. 2:00 – 4:45 02:00-04:45

    The instructor presents a specific problem from GATE 2015 asking for the number of onto functions from set $X = \{1, 2, 3, 4\}$ to set $Y = \{a, b, c\}$. He identifies $m=4$ and $n=3$ and substitutes these into the previously shown formula. The calculation is written out as $3^4 - {}^3C_1(3-1)^4 + {}^3C_2(3-2)^4 - {}^3C_3(3-3)^4$. He simplifies this to $81 - 3(16) + 3(1)$, performing the arithmetic to get $81 - 48 + 3$, which equals 36. He circles the final answer 36 on the screen to conclude the example.

The video provides a clear pedagogical progression from theory to practice. It starts by establishing the theoretical framework for counting onto functions using the Principle of Inclusion-Exclusion, providing a reusable formula for students. It then immediately reinforces this theory by solving a concrete, exam-style problem. By breaking down the substitution of $m=4$ and $n=3$ into the formula and showing the detailed arithmetic, the instructor ensures students understand not just the formula itself, but also the mechanics of applying it correctly to find the number of surjective mappings between sets of different sizes.

Loading lesson…