<html aria-label="message body"><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body style="overflow-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;">In 1988, Noam Elkies at Harvard and I collaborated on finding counter-examples to Euler\u2019s 1769 conjecture about sums of 4th powers. He proved that there are an infinite number of counter-examples, and I used all of the Connection Machines at Thinking Machines to find the smallest.<div><br></div><div>Since then, other researchers have used variations of my brute force technique and Elkies\u2019 Elliptic Curve technique to extend the number of known solutions. As of yesterday, there were 93 solutions less than 1e27. Today I found 4 more with a newer Elliptic Curve technique.</div><div><br></div><div>I published my result as a comment at Math StackExchange: <a href="https://math.stackexchange.com/questions/4857229/on-why-solutions-to-x4y4z4-1-come-in-pairs/5123321">https://math.stackexchange.com/questions/4857229/on-why-solutions-to-x4y4z4-1-come-in-pairs/5123321</a> .</div><div><br></div><div>The code I used is in my GitHub repository: <a href="https://github.com/rfryeSigma">https://github.com/rfryeSigma</a> .</div><div><br></div><div>-Roger</div><div>p.s. I am looking for programming work. I specialize in Machine Learning and physics simulations, but I would be interested in anything challenging.</div></body></html>