# Heaviside’s partial fraction decomposition method.

A brief explanation of Heaviside’s cover-up method for partial fraction decomposition, domain extensions and applications to computer algebra.

# On factorial function approximation

A review of various ways to approximate the factorial function, Gamma function and Digamma function.

# Implementing the Faddeev-LeVerrier algorithm in APL

A multipurpose mathematical beauty demonstrated in APL.

# Implementing Taylor Series in APL

A short explanation behind my implementation of the Taylor Series in APL.

# Explanation of my Code Guessing entry (round 6)

An analysis of my code guessing round 6 entry.

# Matrix Rearrangements - solving a problem with APL.

Given a NxM matrix, one can pick a single element from each row so that the cost of this operation is the smallest. The cost is defined as the sum of every other element left in a row. For each column containing nonzero elements, an element must be picked so that every other element besides the chosen one must originate from different rows. What is the lowest cost for a given matrix?

# What does GCD have in common with leap years?

If [ gcd(80, x) > gcd(50, x) ], then year x is leap. But why?

# Combinator calculus - a lab notebook

A writeup on my passion for combinator calculus.

# Fibonacci sequence - a tiny, infinite(*) generator

In July of 2020 was working with Ada#0132 on a small, multiprecision fibonacci sequence generator written in C.