Problem 38 on Shai Asher

Solving the Pandigital Puzzle with AVX2 SIMD Acceleration.

Mon, 21 Jul 2025 12:53:38 +0000

Using AVX2 SIMD instructions in C++ to accelerate the search for the largest 1-9 pandigital concatenated product.

If you’ve ever tackled Project Euler Problem 38, you’re likely familiar with the hunt for the largest 1-to-9 pandigital number that can be formed by concatenating the product of an integer with (1, 2, ..., n).

Solving Project Euler 38 with MATLAB: The Vectorized Pandigital Blitz

Sun, 20 Jul 2025 19:19:31 +0000

This post is part of a multi-language series exploring the problem of finding the largest 1–9 pandigital concatenated product. Check out the C# and Python editions too.

Why MATLAB?

MATLAB might not be the first language that comes to mind for algorithmic problem solving, but its strength in matrix manipulation and vectorized computation makes it a powerful ally for concise, high-performance numeric routines.

Solving Pandigital Multiples with C# and Length‑Based Pruning

Sun, 20 Jul 2025 18:54:33 +0000

In this post, we’ll explore a C# implementation that finds the largest 1–9 pandigital concatenated product by mathematically pruning the search space based on digit lengths, rather than brute-forcing all possibilities.

1. The Pandigital Multiples Problem Recap

We seek the maximum 9‑digit number formed by concatenating the products:

Optimizing Pandigital Multiples in Python

Sun, 20 Jul 2025 18:53:29 +0000

In this follow-up post, we’ll transform our straightforward brute-force solution into a lean, mean, Pythonic machine, avoiding strings, pruning early, and utilizing bitmasks and vectorized data structures for clarity and speed.

1. Integer‑Only Concatenation

Instead of building a string, we’ll assemble the concatenated product as an integer. We keep track of:

Programmatically Finding Pandigital Multiples

Sun, 20 Jul 2025 16:41:53 +0000

In this post we’ll go step by step through a clear, Python-based approach to solve the “concatenated pandigital multiples” problem. We’ll explain each part in simple terms, provide complete code examples, and ensure every detail is fully understandable—even if you’re new to programming.

Project Euler 38: Solving with Pen and Paper Like It’s 1899 🖊️

Sun, 20 Jul 2025 16:40:36 +0000

In the age of compilers and cloud computing, it’s easy to forget how powerful logic and a pencil can be. Project Euler Problem 38 — finding the largest 1 to 9 pandigital number formed as a concatenated product — is typically solved with code. But what if we couldn’t code it? Could we solve it by Hand?