Back in 1979 I wrote a Z80 machine language program on a TRS-80 Model I[0] to implement the Pollard Rho algorithm[1] and explore factoring repunits[2]. To moni

Back in 1979 I wrote a Z80 machine language program on a TRS-80 Model I[0] to implement the Pollard Rho algorithm[1] and explore factoring repunits[2]. To monitor it I would put an AM radio next to the machine and listen to the noise. The "Run around the loop" phase made a Chuntering[3] noise, and then the GCD[4] phase, implemented via Euclid's Algorithm[5] made a wonderfully ascending whoosh! It was fairly straight-forward to know where the code was, and what it was doing, and it was great to fall asleep to of an evening. ================ [0] https://en.wikipedia.org/wiki/TRS-80 https://en.wikipedia.org/wiki/TRS-80 [1] https://en.wikipedia.org/wiki/Pollard%27s_rho_algorithm https://en.wikipedia.org/wiki/Pollard%27s_rho_algorithm [2] https://en.wikipedia.org/wiki/Repunit https://en.wikipedia.org/wiki/Repunit [3] https://dictionary.cambridge.org/dictionary/english/chuntering https://dictionary.cambridge.org/dictionary/english/chunteri... [4] https://en.wikipedia.org/wiki/Greatest_common_divisor https://en.wikipedia.org/wiki/Greatest_common_divisor [5] https://en.wikipedia.org/wiki/Greatest_common_divisor#Euclid's_algorithm https://en.wikipedia.org/wiki/Greatest_common_divisor#Euclid...