Explanation of my Code Guessing entry (round 6)

Explanation of my Code Guessing entry (round 6)
An analysis of my code guessing round 6 entry.
Read more →

Matrix Rearrangements - solving a problem with APL.

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?
Read more →

What does GCD have in common with leap years?

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

Combinator calculus - a lab notebook

A writeup on my passion for combinator calculus.
Read more →

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.
Read more →