A better Example
Let’s take a look at another example, this time lets use:
n
∑ i2 = (n(n+1)(2n+1)) / 6
i=0
Where we have:
n
L(n) = ∑ i2 and R(n) = (n(n+1)(2n+1)) / 6
i=0
For now I will skip the base case. However, do note that when n=0 for the base case, L(0)=R(0), so that the base [...]
Archive for the ‘Discrete Maths’ Category
31 May
COMP10020 – Discrete Maths – Induction (part 2)
31 May
COMP10020 – Discrete Maths – Induction (part 1)
[ A = for all. E = there exists ]
The Principles of Induction
Firstly, welcome to Induction. The one thing in Discrete Maths that I hear a heck of a lot of people complaining about! – So don’t worry, you’re not the only one
Here I shall attempt – attempt being the key word – [...]
7 May
COMP10020 – Discrete Maths – Functions (Part 2)
>>Want more notes on Functions? try here: Mindez
Composition of Functions
Say we have 2 functions:
f: R ——> S1
g: S2 —–> T
These functions are only composable, or have an inter-relationship when
S1 = S2
When these conditions are met, we can safely define the composite of the functions as:
h = g о f
This states that h is equal to f [...]
6 Apr
COMP10020 – Maths — Functions (part 1)
>>Want more notes on Functions? try here: Mindez
In Discrete Maths, ‘Functions’ have 3 features:
Source (S) , or more commonly known as the Domain
Target (T), or more commonly known as the CoDomain
Behaviour, which is what the function does as it transforms the source (input) into the target (output)
Note: the source and the target are both sets.
Functions [...]
