🐤 floppsy - SMHasher-passing 200Mb/s hash using floating-point ops

An algorithm for dense Egyptian fractions, actually, unit fractions

Given a rational number n, n >= 0, with denominator strictly positive, decompose this number as a sum of rationals with numerators equal to one and without repetitions.

Solution to problem 2 in https://www.cs.scranton.edu/~mccloske/hs_prog_contest/contest_problems/probs_07_head.pdf

A FreeBasic program for finding Egyptian fraction expansions

egyptian fractions with small denominators

Egyptian fraction represenation in rust