There were a subset of problems in math that could only be brute-forced by computers because the number of possibilities are too much for humans to reliably cal

There were a subset of problems in math that could only be brute-forced by computers because the number of possibilities are too much for humans to reliably calculate and then verify. An early example of this was Euler’s Sum of Powers Conjecture that was disproven (1966) and then The Boolean Pythagorean Triples Problem proven more recently (2016). A more practical example is prime number generation. These all were because of computer algorithms and I don't know why they are not discussed more in the context of AI solving math. The number of decidable math problems that brute-force algorithms can solve have shrunken smaller and smaller every year because of the increases in processing capabilities. We could frame AI generated solutions to yet unsolved math problems as the next generation of these algorithms.