Fractran champions

From BusyBeaverWiki
Revision as of 03:39, 2 October 2026 by Int-y1 (talk | contribs) (1 fraction)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In this article we focus on the longest running Fractran programs containing a specific number of fractions and primes.

Champions with 1 fraction

Primes used Max runtime Example champion(s) First champion's vector representation Champion found Notes
1 1 [1/2] [−1]
2 1 [3/2] [−11]
3 1 [9/2] [−12]
4 1 [27/2] [−13]
5 1 [81/2] [−14]
n 1 [3n−1/2] [−1n−1]