🐤 floppsy - SMHasher-passing 200Mb/s hash using floating-point ops
An algorithm for dense Egyptian fractions, actually, unit fractions
A finite algebraic covering system for the Erdos-Straus conjecture, verified to 10^11 (max A = 359); exploratory search to 1.2x10^12 finds A = 479. Gateway decompositions via divisors of N^2.
Solution to problem 2 in https://www.cs.scranton.edu/~mccloske/hs_prog_contest/contest_problems/probs_07_head.pdf
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.
A FreeBasic program for finding Egyptian fraction expansions
egyptian fractions with small denominators
Add a description, image, and links to the egyptian-fractions topic page so that developers can more easily learn about it.
To associate your repository with the egyptian-fractions topic, visit your repo's landing page and select "manage topics."