Yan Cui

I help clients go faster for less using serverless technologies.

**This article is brought to you by**

**Is your CI build step taking too long?** Try Depot for free today and experience up to **40x faster build speed**!

#### Problem

The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be expressed in such a way:

28 = 2^{2}+ 2^{3}+ 2^{4}

33 = 3^{2}+ 2^{3}+ 2^{4}

49 = 5^{2}+ 2^{3}+ 2^{4}

47 = 2^{2}+ 3^{3}+ 2^{4}

How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?

#### Solution

// generate all prime numbers under <= this max let max = int64(sqrt(double(50000000L))) // initialise the list with 2 which is the only even number in the sequence let mutable primeNumbers = [2L] // only check the prime numbers which are <= the square root of the number n let hasDivisor n = primeNumbers |> Seq.takeWhile (fun n' -> n' <= int64(sqrt(double(n)))) |> Seq.exists (fun n' -> n % n' = 0L) // only check odd numbers <= max let potentialPrimes = Seq.unfold (fun n -> if n > max then None else Some(n, n+2L)) 3L // populate the prime numbers list for n in potentialPrimes do if not(hasDivisor n) then primeNumbers <- primeNumbers @ [n] // use the same hasDivisor function instead of the prime numbers list as it offers // far greater coverage as the number n is square rooted so this function can // provide a valid test up to max*max let isPrime n = if n = 1L then false else not(hasDivisor(n)) let answer = primeNumbers |> Seq.collect (fun n -> primeNumbers |> Seq.map (fun n' -> pown n 2 + pown n' 3) |> Seq.takeWhile (fun sum -> sum < 50000000L)) |> Seq.collect (fun sum -> primeNumbers |> Seq.map (fun n -> sum + pown n 4) |> Seq.takeWhile (fun sum' -> sum' < 50000000L)) |> Seq.distinct |> Seq.length

The biggest prime that can appear in the equation is equals to the square root of 50000000 – 8 – 16, which, incidentally is just over 7000, so the numbers of primes involved is reasonably small which bodes well for a fast solution!

The logic in this solution is otherwise simple, using the cached prime numbers list to first generate numbers (< 50 million) that can be written as the sum of a prime square and prime cube; then for each number see if we can add a prime fourth power and get a sum less than 50 million.

One thing that caught me out initially was the need to search for distinct numbers as some of these numbers do overlap, but otherwise this is a solution which runs happily under 3 seconds.

**Whenever you’re ready, here are 4 ways I can help you:**

**Production-Ready Serverless**: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for**quickly levelling up your serverless skills**.- Do you want to know
**how to test serverless architectures**with a fast dev & test loop? Check out my latest course,**Testing Serverless Architectures**and learn the smart way to test serverless. - I help clients
**launch product ideas**,**improve their development processes**and**upskill their teams**. If you’d like to work together, then let’s**get in touch**. **Join my community on Discord**, ask questions, and join the discussion on all things AWS and Serverless.