Project EulerSolving the Pandigital Puzzle with AVX2 SIMD Acceleration.
Bringing AVX2 to Project Euler 38 — what 256-bit registers buy when the same pandigital check runs over thousands of candidates, and how the C++ compares to scalar code.
Project Euler
Solving Project Euler 38 with MATLAB: The Vectorized Pandigital Blitz
Vectorising Project Euler 38 in MATLAB: build the concatenated products as a matrix, test every candidate in one pass, and let the language do what it is actually good at.
Solving Pandigital Multiples with C# and Length‑Based Pruning
A C# solution that prunes by digit length instead of brute-forcing: the constraint that the products must total nine digits bounds k to a handful of ranges.
Optimizing Pandigital Multiples in Python
Turning the brute-force Python solution lean: integer concatenation instead of strings, a 10-bit mask for the pandigital test, and early exits that prune the search.
Programmatically Finding Pandigital Multiples
A step-by-step Python solution to Project Euler 38: why the search stops at 9999, how to build each concatenated product, and a straightforward pandigital check.
Project Euler 38: Solving with Pen and Paper Like It’s 1899 🖊️
Project Euler 38 without a computer: digit-count arithmetic narrows the search to four-digit numbers starting with 9, and the rest is pen, paper and a little logic.
The Fascinating World of Pandigital Multiples
What makes 192384576 special, and why concatenating the multiples of 9327 gives the largest 1–9 pandigital number you can build this way. No code, just the puzzle.