Practice Part (a): Counting Functions - 2.4.1 | 2. Introduction | Discrete Mathematics - Vol 2
K12 Students

Academics

AI-Powered learning for Grades 8–12, aligned with major Indian and international curricula.

Professionals

Professional Courses

Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.

Games

Interactive Games

Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.

Practice Questions

Test your understanding with targeted questions related to the topic.

Question 1

Easy

Define an injective function and give an example.

💡 Hint: Think of a simple linear function.

Question 2

Easy

What is a surjective function?

💡 Hint: Consider mappings to fewer elements.

Practice 4 more questions and get performance evaluation

Interactive Quizzes

Engage in quick quizzes to reinforce what you've learned and check your comprehension.

Question 1

What defines a surjective function?

💡 Hint: Think of it as 'onto' mapping.

Question 2

If a function has 5 elements in the domain and 3 in the codomain, how many injective functions can it have?

  • 1
  • 0
  • 6

💡 Hint: Consider if you can assign unique outputs for all inputs.

Solve 2 more questions and get performance evaluation

Challenge Problems

Push your limits with challenges.

Question 1

Prove that if you're given a surjective function from a finite set A (with 4 elements) to another finite set B (with 3 elements), A cannot contain an injective function.

💡 Hint: Reflect on the definitions of injective versus surjective.

Question 2

Calculate the number of surjective functions from set A with 5 elements to set B with 3 elements using Stirling numbers.

💡 Hint: Use the Stirling function properties and recall how permutations affect partitions.

Challenge and get performance evaluation