Math

A Bayesian network is a directed graph in which each node is annotated with quantitative probability information. This article covers the definition of a bayesian network with a graphical representation, the determination of independence between variables and the problem of finding the probability distribution of a set of query values given some observed events.

Let $a,b \in \mathbb{Z}$, we say that $a$ divides $b$, written $a \given b$, if there’s an integer $n$ so that: $b = na$. If $a$ divides $b$ then $b$ is divisible by $a$ and $a$ is a divisor or factor of $b$, also $b$ is called a multiple of $a$.

This article covers the greatest common divisor and how to find it using the euclidean algorithm, the extended euclidean algorithm to find solutions to the equation $ax + by = gcd(a, b)$ where $a, b$ are unknowns.

An affine space is a generalization of the notion of a vector space, but without the requirement of a fixed origin or a notion of “zero”.

Different algorithms to test geometric properties like finding the intersection of two lines.

An eigenvalue represents how the object scales (or stretches/compresses) a particular direction (or eigenvector) when acted upon by the object. This article covers how to find these values in a square matrix as well as how it’s applicable in compute graphics.

In projective geometry unlike euclidean geometry, two parallel lines meet at a point. Desargues introduced the concept of a line at finity where a point at infinity can be defined. This article covers the need of a point at infinity in projective space, the line at infinity and the projective plane.

Quaternions are a set of 4-dimensional vectors that are used to represent rotations in computer graphics, they were discovered by William Hamilton as an extension of 2d complex numbers to a 3d equivalent.

This article covers the definition of a quaternion, its notation and operations.

Imaginary numbers were invented to solve problems for equestions with no real roots, complex numbers extend imaginary numbers by adding a real number.

This article covers the definition of complex numbers, operations such as addition, product, norm, conjugate, inverse and square root. Finally, this article covers the geometric and polar representations of complex numbers.

Integer factorization is the process of decomposing a composite number into a product of smaller integers, if these integers are restricted to be prime numbers then the process is called prime factorization.

This article covers factorization using trial division and fermat factorization through Pollard's Rho algorithm and using the sieve of eratosthenes.

The divisor function returns the number of divisors of an integer. This article covers important relations of the divisor function and prime numbers.

A prime number is a natural number greater than $1$ which has no positive divisors other than $1$ and itself.

This article covers different algorithms for checking if a number is prime or not including a naive test, the erathostenes sieve, the euler primality test and the miller-rabin primality test.

This article describes and implements a solution for the following problem, given two numbers $n$ and $k$ find the greatest power of $k$

Let $n!_{\%p}$ be a special factorial where $n!$ is divided by the maximum exponent of $p$ that divides $n!$. This article describes this problem and its solution with an implementation in C++.

The discrete logarithms finds a solution for $x$ in the congruence $a^x \equiv b \pmod{n}$ where $a$, $b$ and $n$ are integers, $a$ and $n$ are coprime. I cover two algorithms to solve this problem: by trial multiplication and using baby step giant step.

The chinese remainder theorem (CRT) is a theorem that deals with finding a solution to a system of congruences.

This article covers the defition of the CRT and an example implementation in C++.

Modular arithmetic is a type of arithmetic that deals with integers and remains within a fixed range of values. It involves performing arithmetic operations such as addition, subtraction, multiplication, and division, but with the added concept of a “modulus” or a “mod” value.

This article covers the definition a congruence relation, and some of its properties like addition, multiplication, exponentiation and inverse. Next I show how we can use the extended euclidean algorithm to find the modular multiplicative inverse in a general case and in the case of coprime numbers.

The extended euclidean algorithm finds solutions to the equation $ax + by = gcd(a, b)$ where $a, b$ are unknowns. This article covers a few applications of the extended euclidean algorithm like finding the modular multiplicative inverse of a number, and finding solutions for linear congruence equations.

Given two numbers $a$ and $n$ finding $a^n$ involves doing $n$ multiplications of $a$, however, it’s possible to do this in $log(n)$ operations by using binary exponentiation.

The erathostenes sieve is an algorithm to find prime numbers up to a positive number $n$ using $O(n)$ space.

The euclidean algorithm finds the greatest common divisor of two numbers. In this article I implement the algorithm from scratch in C++.

Euler’s phi function represented as $\phi(n)$ gives for a number $n$ the number of coprimes in the range $[1..n]$, in other words the quantity numbers in the range $[1..n]$ whose greatest common divisor with $n$ is the unity. In this article I try to explain how it works and implement it in C++.

The derivative is a concept that represents the rate of change or the slope of a function at a particular point. It is a fundamental concept in calculus and is used to analyze how a function changes with respect to its input as the input changes very slightly.

This article covers physical and geometric interpretation of the derivative as well as some applications like finding maxima and minima in a function and newton-raphson.

An integral is a mathematical concept that represents the accumulation or summing up of quantities over a certain interval or region. In this article we’ll discuss the properties of the integral by looking an example of antidifferentiation and some examples of evaluating definite integrals.

Taylor Series helps approximate the value of a definite integral for a function whose antiderivative is hard to find. This article explains the key ideas behind Taylor’s Theorem and an example of approximating its value with a polynomial function.

This article gives an introduction to calculus starting with the concept of a function and how calculus helps us solve problems related to determining tangents to curves (expressed as functions), finding the minim/maxima like determinining the maximum range of a projectile, and to find the length of curves areas and volumes.