Project Euler's higher-numbered problems often require a combination of analytic solutions to vastly simplify some parts of the search space, and brute force for the rest. Without math or lucky guesses—where you've googled a partial solution you don't understand, or you've naively found a function which seems to get the right answer for test cases, but you can't be sure it generalizes—you're left with brute force methods that won't finish in a reasonable amount of time, possibly not even before the Sun turns into a red giant.
Those kinds of problems are not relevant to most everyday software engineering, but in the few cases when you need math, you really need it or you have to scrap the entire feature for being too slow or impractical.
Those kinds of problems are not relevant to most everyday software engineering, but in the few cases when you need math, you really need it or you have to scrap the entire feature for being too slow or impractical.
Also, designing neural nets...