# 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.

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

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

A multipurpose mathematical beauty demonstrated in APL.

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

An analysis of my code guessing round 6 entry.

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?

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

A writeup on my passion for combinator calculus.

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