Mathematics for Engineers on Software Engineering Learning Paths

Numbers & Arithmetic

Mon, 01 Jan 0001 00:00:00 +0000

Numbers & Arithmetic#

Every computation a computer performs reduces to arithmetic on numbers. Understanding number systems — what they represent, how they are stored, and where they break — is the foundation of everything that follows.

Number Systems#

Mathematics organises numbers into nested sets, each extending the previous one to solve problems the smaller set cannot.

Symbol	Name	Contains	Example
ℕ	Natural numbers	0, 1, 2, 3, …	Counting items in a list
ℤ	Integers	…, -2, -1, 0, 1, 2, …	Signed offsets, deltas
ℚ	Rational numbers	Any number expressible as p/q where p, q ∈ ℤ and q ≠ 0	1/3, 7/4, -22/7
ℝ	Real numbers	All rationals plus irrationals (π, √2, e)	Continuous measurements
ℂ	Complex numbers	a + bi where a, b ∈ ℝ and i² = -1	Signal processing, quantum computing

Why This Matters#

Array indices are natural numbers (ℕ).
Database offsets and deltas are integers (ℤ).
Financial calculations use rationals (ℚ) — never floating-point.
Physics simulations operate on reals (ℝ), approximated by floats.
Fourier transforms and quantum gates use complex numbers (ℂ).

Key Properties#

Every number system inherits the properties of the sets below it and adds new ones:

Algebra

Mon, 01 Jan 0001 00:00:00 +0000

Algebra#

Algebra is the machinery for manipulating symbols and solving equations — the language in which algorithms express their relationships, complexity bounds are derived, and configuration parameters are computed.

Expressions, Equations, and Identities#

Expressions#

An expression is a mathematical phrase that combines numbers, variables, and operations. It does not have an equals sign.

3x + 7
n² - 1
log₂(n) + 1

Equations#

An equation asserts that two expressions are equal. It can be solved for unknowns.

Functions & Graphs

Mon, 01 Jan 0001 00:00:00 +0000

Functions & Graphs#

A function is a rule that assigns exactly one output to each input. Functions are the abstraction behind every algorithm’s behaviour, every complexity analysis, and every mathematical model in engineering.

What Is a Function?#

Formally, a function f: A → B is a mapping from a set A (the domain) to a set B (the codomain) where every element of A maps to exactly one element of B.

Discrete Mathematics

Mon, 01 Jan 0001 00:00:00 +0000

Discrete Mathematics#

Discrete mathematics deals with countable, separated values — the natural habitat of computers, which process distinct symbols, not continuous quantities. Sets, relations, and combinatorics form the theoretical foundation of data structures, databases, and algorithms.

Sets#

A set is an unordered collection of distinct elements.

Notation#

A = {1, 2, 3, 4, 5} Roster notation
B = {x ∈ ℤ | x > 0 and x ≤ 5} Set-builder notation
∅ = {} Empty set

Set Operations#

Operation	Symbol	Definition	Example (A={1,2,3}, B={2,3,4})
Union	A ∪ B	Elements in A or B (or both)	{1, 2, 3, 4}
Intersection	A ∩ B	Elements in both A and B	{2, 3}
Difference	A \ B	Elements in A but not B	{1}
Symmetric difference	A △ B	Elements in exactly one of A or B	{1, 4}
Complement	Aᶜ	Elements not in A (relative to universe U)	U \ A
Cartesian product	A × B	All ordered pairs (a, b)	{(1,2),(1,3),(1,4),…}

Set Properties#

Property	Formula
Commutative	A ∪ B = B ∪ A, A ∩ B = B ∩ A
Associative	(A ∪ B) ∪ C = A ∪ (B ∪ C)
Distributive	A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
De Morgan’s	(A ∪ B)ᶜ = Aᶜ ∩ Bᶜ, (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ
Idempotent	A ∪ A = A, A ∩ A = A
Identity	A ∪ ∅ = A, A ∩ U = A

In Programming#

A = {1, 2, 3}
B = {2, 3, 4}

A | B # {1, 2, 3, 4} union
A & B # {2, 3} intersection
A - B # {1} difference
A ^ B # {1, 4} symmetric difference
A <= B # False subset check

SQL SELECT with UNION, INTERSECT, EXCEPT maps directly to set operations.

Logic & Proofs

Mon, 01 Jan 0001 00:00:00 +0000

Logic & Proofs#

Logic is the science of valid reasoning — the same principles that govern circuit design, type systems, query optimisation, and formal verification. Proof techniques are how you demonstrate that algorithms are correct and that security properties hold.

Propositional Logic#

Propositional logic deals with statements (propositions) that are either true or false, connected by logical operators.

Logical Connectives#

Connective	Symbol	Name	English	Example
NOT	¬	Negation	“not p”	¬(it is raining)
AND	∧	Conjunction	“p and q”	(sunny) ∧ (warm)
OR	∨	Disjunction	“p or q” (inclusive)	(admin) ∨ (owner)
XOR	⊕	Exclusive or	“p or q but not both”	(left) ⊕ (right)
IMPLIES	→	Implication	“if p then q”	(logged_in) → (has_session)
IFF	↔	Biconditional	“p if and only if q”	(x>0) ↔ (x is positive)

Truth Tables#

AND:

Graph Theory

Mon, 01 Jan 0001 00:00:00 +0000

Graph Theory#

Graphs model relationships between things — networks, dependencies, routes, social connections, state machines. Graph theory provides the language and algorithms for navigating, searching, and optimising these structures.

Definitions#

A graph G = (V, E) consists of:

V — a set of vertices (nodes)
E — a set of edges (connections between vertices)

Types of Graphs#

Type	Description	Example
Undirected	Edges have no direction	Facebook friendships
Directed (digraph)	Edges have direction (u → v)	Twitter follows, dependencies
Weighted	Edges have numeric weights	Road distances, latencies
Unweighted	All edges are equal	Simple connectivity
Simple	No self-loops or parallel edges	Most theoretical graphs
Multigraph	Allows parallel edges	Flight routes between cities
Complete (Kₙ)	Edge between every pair of vertices	Fully connected network
Bipartite	Vertices split into two sets, edges only between sets	Job assignments, matching
DAG	Directed acyclic graph	Task dependencies, Git commits

Terminology#

Term	Definition
Adjacent	Two vertices connected by an edge
Degree	Number of edges incident to a vertex
In-degree / Out-degree	Edges coming in / going out (directed graphs)
Path	Sequence of vertices where each consecutive pair is connected
Cycle	Path that starts and ends at the same vertex
Connected	Every vertex is reachable from every other (undirected)
Strongly connected	Every vertex reachable from every other following edge directions (directed)
Component	Maximal connected subgraph

The Handshaking Lemma#

In any undirected graph, the sum of all vertex degrees equals twice the number of edges:

Linear Algebra

Mon, 01 Jan 0001 00:00:00 +0000

Linear Algebra#

Linear algebra is the mathematics of vectors, matrices, and linear transformations. It is the computational engine behind machine learning, computer graphics, data compression, search engines, and recommendation systems.

Vectors#

A vector is an ordered list of numbers. It can represent a point in space, a direction, a data record, or a feature embedding.

v = [3, 4] 2D vector
w = [1, 0, -2, 5] 4D vector

Vector Operations#

Operation	Formula	Example
Addition	u + v = [u₁+v₁, u₂+v₂, …]	[1,2] + [3,4] = [4,6]
Scalar multiplication	c·v = [cv₁, cv₂, …]	3·[1,2] = [3,6]
Dot product	u·v = Σ uᵢvᵢ	[1,2]·[3,4] = 3+8 = 11
Magnitude (norm)	‖v‖ = √(Σ vᵢ²)	‖[3,4]‖ = √(9+16) = 5
Unit vector	v̂ = v / ‖v‖	[3,4]/5 = [0.6, 0.8]

The Dot Product#

The dot product captures the notion of alignment between two vectors:

Probability

Mon, 01 Jan 0001 00:00:00 +0000

Probability#

Probability quantifies uncertainty. It is the mathematical framework behind reliability engineering, machine learning, A/B testing, cryptographic security, and capacity planning. If you build systems that interact with the real world, you reason about probability whether you formalise it or not.

Foundations#

Sample Space and Events#

Experiment: A process with uncertain outcome (rolling a die, receiving a request)
Sample space (Ω): The set of all possible outcomes
Event (A): A subset of the sample space

Rolling a die:
 Ω = {1, 2, 3, 4, 5, 6}
 A = "even number" = {2, 4, 6}
 P(A) = |A| / |Ω| = 3/6 = 1/2

Axioms of Probability#

P(A) ≥ 0 for any event A
P(Ω) = 1 (something must happen)
For mutually exclusive events: P(A ∪ B) = P(A) + P(B)

Basic Rules#

Rule	Formula
Complement	P(not A) = 1 - P(A)
Union	P(A ∪ B) = P(A) + P(B) - P(A ∩ B)
Mutually exclusive	P(A ∪ B) = P(A) + P(B)
Certain event	P(Ω) = 1
Impossible event	P(∅) = 0

Conditional Probability#

The probability of A given that B has occurred:

Statistics

Mon, 01 Jan 0001 00:00:00 +0000

Statistics#

Statistics is the discipline of learning from data — summarising it, drawing inferences, and making decisions under uncertainty. For engineers, it is the foundation of A/B testing, performance benchmarking, capacity planning, and data-driven decision-making.

Descriptive Statistics#

Measures of Central Tendency#

Measure	Definition	When to Use	Sensitive to Outliers
Mean	Sum / count	Symmetric data	Yes
Median	Middle value (sorted)	Skewed data, outliers	No
Mode	Most frequent value	Categorical data	No

Example: Response times [12, 15, 14, 13, 850] ms

Calculus Essentials

Mon, 01 Jan 0001 00:00:00 +0000

Calculus Essentials#

Calculus is the mathematics of change and accumulation. This section covers the minimum viable calculus for engineers — enough to understand gradient descent, optimisation, and the mathematical foundations of machine learning without a full analysis course.

Limits#

A limit describes the value a function approaches as its input approaches some point.

lim (x → a) f(x) = L

Means: as x gets arbitrarily close to a, f(x) gets arbitrarily close to L.

Information Theory

Mon, 01 Jan 0001 00:00:00 +0000

Information Theory#

Information theory, founded by Claude Shannon in 1948, quantifies information, uncertainty, and communication. It provides the mathematical framework for compression, error correction, cryptography, and — surprisingly — the loss functions used in machine learning.

Information Content#

How much “information” does an event carry? Intuitively, rare events are more informative than common ones. “The sun rose this morning” is unsurprising (low information). “An earthquake just hit” is surprising (high information).

Mathematics in Practice

Mon, 01 Jan 0001 00:00:00 +0000

Mathematics in Practice#

This section bridges mathematical theory to engineering reality — the numerical traps that bite in production, the probabilistic methods that solve intractable problems, and the mathematical principles hiding inside everyday tools.

Numerical Stability#

The Fundamental Problem#

Computers work with finite-precision arithmetic. Every floating-point operation can introduce a small error, and these errors accumulate. Code that is mathematically correct can be numerically wrong.

Catastrophic Cancellation#

Subtracting nearly equal numbers amplifies relative error: