A simple question from Project Euler, as usual, and - also as usual - a warning not to read further if you don't want to deprive yourself of the pleasure of looking for the solution.…
Time for a new problem from Project Euler. Admittedly, a fairly easy problem to solve - you don't even need to be able to program for it, as long as you can work with software such as Excel. Of course I do not only want to find the right solution, but also a way with which we can also solve the same problem if the limits are slightly higher. Feel free to read on for the solution and for a quick and simple algorithm.…
Ever wondered how to find the smallest multiple of consecutive numbers? The people at Project Euler too. Below the fifth problem and a possible solution.…
Time for a new problem, and a possible solution, from Project Euler: searching for palindromic numbers. As always, stop reading if you want to find the solution yourself.…
Don't read further if you don't want a spoiler, because today I'm going to dive into Project Euler's third problem. A problem with prime numbers this time.…