Read what Knuth writes: https://www-cs-faculty.stanford.edu/~knuth/papers/claude-cycles.pdf
Op do 5 mrt 2026, 15:04 schreef Michael Orlitzky <[email protected]>: > On 2026-03-05 15:48:24, Georgi Guninski wrote: > > The AI gonna own us all. > > > > > https://www.toolmesh.ai/news/claude-ai-solves-graph-theory-conjecture-knuth > > How much is the monthly subscription to Donald Knuth? > > > While Claude provided the construction method, Knuth subsequently > > provided the rigorous mathematical proof, demonstrating that the > > path visited all m^2 vertices with the same i value, then covered all > > i sequentially, forming a complete cycle of length m^3. Similar > > proofs applied to the other two cycles, thus solving the entire > > problem. > > > > Knuth further discovered that Claude's solution was not unique, with > > 760 similar decomposition methods existing, all sharing the same > > structure. Claude had found just one of these. It is important to > > note that Claude only solved the case where m is odd; a general > > solution for even m remains elusive, and the m=2 case has been > > proven impossible. > > Having used the computer to discover things that are probably true is > probably true of everyone here. > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To view this discussion visit > https://groups.google.com/d/msgid/sage-devel/aamNWnZESVFDXyf7%40mertle. > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion visit https://groups.google.com/d/msgid/sage-devel/CAK0%3DbK2ZRq29oMBjQwQR%3DU_WjJNzc4r%2ByCcKqMtH%3DJGOURU9TA%40mail.gmail.com.
