## Project Euler in PL/SQL: Problem 11

Problem 11 of Project Euler presents us a brute-force challenge of checking multiple products from a number grid.

Problem 11 of Project Euler presents us a brute-force challenge of checking multiple products from a number grid.

This problem rounds out the first 10 Project Euler problems! Here we’ll utilize the EULER_PKG again to make for an easy solution.

Problem 9: Special Pythagorean Triplet A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a^2 + b^2… Read More »Project Euler in PL/SQL: Problem 9

Another Project Euler problem and solution that utilizes loops.

This Project Euler problem gave me some serious optimization issues as we deal with checking a wide range of numbers to see if they’re prime.

Another Project Euler problem that doesn’t prove to be much of a challenge.

As I make my way through these Project Euler problems, I’m noticing some trends in calculations and questions I keep needing to ask about a… Read More »Project Euler in PL/SQL: EULER_PKG

Project Euler is back with a math problem that’ll take some tuning to be efficient.

Time for another Project Euler problem. This problem is somewhat simple, but we need to dive into some SQL to solve it!

Onward to the next problem from Project Euler. We’re getting more complex now, and I’ll need to introduce a subfunction for best results.

- « Previous
- 1
- 2
- 3
- Next »