Project Euler – Problem 43 Solution

You can become a serverless blackbelt. Enrol to my 4-week online workshop Production-Ready Serverless and let me take you through building a production-ready serverless application from testing, deployment, security right through to observability. This workshop gives you hands-on experience building something with serverless technologies while giving you a broader view of the challenges you will face as the architecture matures and expands. By the end of the workshop, you should have a clear idea when serverless is a good fit for your system as well as common pitfalls you need to avoid.

Problem

The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.

Let d1 be the 1st digit, d2 be the 2nd digit, and so on. In this way, we note the following:

  • d2d3d4=406 is divisible by 2
  • d3d4d5=063 is divisible by 3
  • d4d5d6=635 is divisible by 5
  • d5d6d7=357 is divisible by 7
  • d6d7d8=572 is divisible by 11
  • d7d8d9=728 is divisible by 13
  • d8d9d10=289 is divisible by 17

Find the sum of all 0 to 9 pandigital numbers with this property.

Solution

let rec distribute e = function
    | [] -> [[e]]
    | x::xs' as xs -> (e::xs)::[for xs in distribute e xs' -> x::xs]

let rec permute = function
    | [] -> [[]]
    | e::xs -> List.collect (distribute e) (permute xs)

// generate the 0 to 9 pandigitals
let numbers = permute [0..9] |> List.map (fun l -> l |> List.map string |> List.reduce (+))

// the corresponding prime divisors and digits
let primes = [2; 3; 5; 7; 11; 13; 17]
let ns = [2..10] |> Seq.windowed 3 |> Seq.toList

// returns the number retrieved from taking the digits at the supplied positions
let d ns (numberStr:string) = 
    int(ns |> Array.map (fun n -> numberStr.[n-1].ToString()) |> Array.reduce (+))

// predicate which identifies pandigital numbers with the desired property
let predicate number = List.forall2 (fun n p -> (d n number) % p = 0) ns primes

let answer = numbers |> List.filter predicate |> List.sumBy int64

One thing you might notice in the creation of the permutations of all 0 to 9 pandigital numbers is the use of (+) in the List.reduce function call. This is actually just the shortened form of:

List.reduce (fun acc item –> acc + item)

Another List function of interest here is the List.forAll2 function, which tests if all corresponding elements in both lists satisfy the given predicate pairwise. In this case, I’m using it to pair up the digits list ([[2;3;4]; [3;4;5];…]) with the primes list ([2;3;5;..17]) to test if a given number has the desired property as described in the problem brief.

We arrive at the answer by simply adding up all the pandigital numbers which matches the predicate condition.

Liked this article? Support me on Patreon and get direct help from me via a private Slack channel or 1-2-1 mentoring.
Subscribe to my newsletter


Hi, I’m Yan. I’m an AWS Serverless Hero and the author of Production-Ready Serverless.

I specialise in rapidly transitioning teams to serverless and building production-ready services on AWS.

Are you struggling with serverless or need guidance on best practices? Do you want someone to review your architecture and help you avoid costly mistakes down the line? Whatever the case, I’m here to help.

Hire me.


Check out my new podcast Real-World Serverless where I talk with engineers who are building amazing things with serverless technologies and discuss the real-world use cases and challenges they face. If you’re interested in what people are actually doing with serverless and what it’s really like to be working with serverless day-to-day, then this is the podcast for you.


Check out my new course, Learn you some Lambda best practice for great good! In this course, you will learn best practices for working with AWS Lambda in terms of performance, cost, security, scalability, resilience and observability. We will also cover latest features from re:Invent 2019 such as Provisioned Concurrency and Lambda Destinations. Enrol now and start learning!


Check out my video course, Complete Guide to AWS Step Functions. In this course, we’ll cover everything you need to know to use AWS Step Functions service effectively. There is something for everyone from beginners to more advanced users looking for design patterns and best practices. Enrol now and start learning!


Are you working with Serverless and looking for expert training to level-up your skills? Or are you looking for a solid foundation to start from? Look no further, register for my Production-Ready Serverless workshop to learn how to build production-grade Serverless applications!

Find a workshop near you