Number of Injective Functions are Possible

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/functions/one-to-one-injective-function-definition-count-and-properties/asset-number-of-injective-functions-are-possible after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video segment explains the mathematical principles for determining the number of possible functions between two sets, specifically focusing on one-to-one mappings. The instructor begins by presenting the standard permutation formula, $^nP_m = P(n, m)$, as the general method for counting these functions. He highlights a specific scenario where the cardinality of both sets is equal ($|A| = |B| = n$), resulting in $n!$ possible functions. To illustrate the general case, he introduces variables $m$ and $n$ for the sizes of sets A and B respectively. He then constructs a visual example on the whiteboard, defining set A with five distinct elements (1, 2, 3, 4, 5) and set B with six distinct elements (a, b, c, d, e, f). He demonstrates the concept of a function by drawing arrows from elements in set A to elements in set B, showing how each element in the domain must map to exactly one element in the codomain.

Chapters

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

    The instructor starts by writing the formula for the number of possible functions as $^nP_m = P(n, m)$. He immediately follows this with a special case: if the size of set A equals the size of set B ($|A| = |B| = n$), then the number of functions possible is $n!$. He then begins a practical demonstration by writing $|A| = m$ and $|B| = n$. He draws two vertical ovals representing the sets. Inside the first oval, labeled A, he lists the numbers 1 through 5. Inside the second oval, labeled B, he lists the letters a through f. He draws arrows originating from the elements of set A pointing towards set B to visualize the mapping process. Below the diagram, he writes out the multiplication sequence $6 imes 5 imes 4 imes 3 imes 2$, representing the number of choices available for mapping each element of A to B.

  2. 2:00 – 3:47 02:00-03:47

    Continuing the example, the instructor writes the formal permutation formula $^nP_m = rac{n!}{(n-m)!}$ on the board. He substitutes the specific values from his example, writing $^6P_5 = rac{6!}{(6-5)!}$. He simplifies the denominator to $1!$ and then to $1$, leaving the result as $6!$. He expands $6!$ into its full product form: $6 imes 5 imes 4 imes 3 imes 2 imes 1$. This confirms the manual calculation he performed earlier in the diagram section. He concludes the segment by summarizing the relationship between the set sizes, writing $|A| = m ightarrow |B| = n$ to reinforce the variables used in the permutation formula for one-to-one functions.

The lecture effectively bridges the gap between abstract formulas and concrete counting methods. By starting with the general permutation formula and then applying it to a specific numerical example, the instructor clarifies how to calculate the number of one-to-one functions. The visual aid of drawing sets and arrows helps students understand the underlying logic of the multiplication principle used in the formula. The final expansion of the factorial confirms the consistency between the algebraic formula and the step-by-step counting method.

Loading lesson…