Tag Archives: Feit-Thompson conjecture

Some unsolved problems in Number Theory are surprisingly not so hard to understand, even for a non-mathematician like myself. The Collatz conjecture is a famous example but there are others: If these conjectures turn out to be false, computational methods may be able to find counterexamples. In the case of the Beal conjecture, assuming thatContinue reading “Trying out LLMs to disprove mathematical conjectures with luck”