Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
1. Sets and Functions
This chapter introduces sets and functions as foundational concepts in mathematics, exploring their definitions, types, and operations. It covers various methods for representing sets, including roster and set-builder forms, and delves into the properties of set operations. Additionally, the chapter defines functions, discusses their classification, and explains concepts like domain, co-domain, range, composition, and inverse functions.
Sections
This section introduces sets and functions, fundamental concepts in mathematics that organize and relate objects.
A set is a well-defined collection of distinct objects.
Functions assign exactly one output in the co-domain to each input from the domain.
Sets can be classified into various types including finite, infinite, and subsets.
Set
A well-defined collection of distinct objects called elements.
Function
A rule that associates each input from the domain with exactly one output in the co-domain.
Union of Sets
An operation that combines all elements from two sets, eliminating duplicates.
Intersection of Sets
An operation that retrieves the common elements from two sets.
Domain
The set of all possible inputs for a function.
Codomain
The set of all possible outputs that the function can yield.
Range
The set of actual outputs produced by the function from the given inputs.
Injective Function
A function where each element in the co-domain is mapped by at most one element in the domain.
Surjective Function
A function where every element in the co-domain has at least one element in the domain mapping to it.
Bijective Function
A function that is both injective and surjective.
Practice Exercises
Total Questions
3
Estimated Time
6 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting