Inverse & Recursive Functions
Foundation Concepts & Applications
Presentation by Group 2
1.1 What Is a Function?
A function is a rule that assigns each element of a set (called
domain) to exactly one element of another set (called
co-domain).
Every input has exactly one unique output.
Foundation for understanding complex mathematical
relationships.
1.2 Key Terminology
Term Meaning
All possible input values.
Domain
Example: {1, 2, 3}
Co-domain All possible outputs a function can potentially have.
Actual outputs that result when the function is applied.
Range
Example: {2, 4, 6}
1.3 Types of Functions
One-to-one Onto Bijective
(Injective) (Surjective) (Injective + Surjective)
No two inputs share the same Every element of the co-domain Both one-to-one AND onto.
output. Distinct inputs map to gets mapped. The range equals the Crucial: Only bijections have
inverses.
distinct outputs. co-domain.
1.4 Why are they Important?
Inverse Functions Recursive Functions
Inverse functions help us reverse processes. Recursive functions help us define complex problems
using smaller sub-problems.
Essential in reversing algorithms, solving equations, and
decrypting information. Fundamental in computer science for algorithms, sorting,
and tree traversals.
2.1 Inverse Functions
Reversing the Effect
An inverse function reverses the effect of the original
function. If you apply f and then f-1, you return to the
original input.
Requirement: The function must be Bijective.
2.4 How to Find the Inverse
Step-by-Step Method
Write the function as y = f(x).
Swap x and y.
Solve the equation for y.
Replace y with f-1(x).
Graphical Test
Horizontal Line Test: A function has an inverse if and only if no
horizontal line touches the graph more than once.
3.1 Fundamental Properties
Reflection Property Composite Functions
The graph of f-1 is the reflection of f across the line y = x. When taking the inverse of a composite function, the
order is reversed.
3.5 Real-Life Applications
Cryptography Conversions Computer Graphics
Essential for encrypting and Converting units, such as Used in geometric transformations
decrypting data. The decryption Fahrenheit to Celsius, requires and undoing effects or rotations in
key acts as the inverse function. inverse operations. 3D space.
4.1 Recursive Functions
Defining the Problem
A recursive function is defined in terms of smaller versions
of itself. It solves complex problems by breaking them down.
Base Case: Stops the recursion (prevents infinite loops).
Recursive Case: Calls itself with a smaller input.
Examples: Factorials, Fibonacci Sequence, Tree Traversals.
4.5 Distinction in Discrete Math
Recursive Function Recurrence Relation
Defined using itself. It is a more general concept used in Describes sequences using previous values. Often used in
programming to solve problems through self-reference. algorithm time analysis (Big O notation) and
mathematical induction.
5.0 Types of Recursive Functions
Linear Binary / Tree Multiple
Calls itself exactly once in each Calls itself twice or more. More than one recursive call.
step. (e.g., Fibonacci, Divide & (e.g., Fractals, Complex State
(e.g., Counting, Factorial) Conquer) Machines)
6.2 Finding the Closed Form
Solving recursive functions implies finding a "Closed Form"
expression without recursion.
Iteration Method: Keep expanding the function until a Why Solve?
pattern appears.
Calculates Time
Substitution Method: Guess the solution and prove it using
Complexity
mathematical induction.
Predicts Algorithm Growth
Recursion Tree Method: Visualize recursive calls as a tree to
sum costs. Scientific Modeling
Master Theorem: A direct formula for divide-and-conquer
recurrences.
7.3 Inverse vs. Recursive
Feature Inverse Function Recursive Function
Core Action Reverses another function Calls itself
Requirement Requires Bijection Requires Base Case + Recursive Step
Existence Only if reversible (One-to-One) Exists for most problems
Primary Use Undoing processes, Decryption Repetitive problem solving, Sorting
Thank you