# Project Euler – Problem 33 Solution

Yan Cui

I help clients go faster for less using serverless technologies.

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

#### Problem

The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is correct, is obtained by cancelling the 9s.

We shall consider fractions like, 30/50 = 3/5, to be trivial examples.

There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.

If the product of these four fractions is given in its lowest common terms, find the value of the denominator.

#### Solution

```// define function to check if two numbers has the cancelling behaviour
let isCancelling a b =
let aStr, bStr = a.ToString(), b.ToString()
if aStr.[0] = bStr.[0] then double(aStr.[1].ToString())/double(bStr.[1].ToString()) = double(a)/double(b)
else if aStr.[0] = bStr.[1] then double(aStr.[1].ToString())/double(bStr.[0].ToString()) = double(a)/double(b)
else if aStr.[1] = bStr.[0] then double(aStr.[0].ToString())/double(bStr.[1].ToString()) = double(a)/double(b)
else if aStr.[1] = bStr.[1] then double(aStr.[0].ToString())/double(bStr.[0].ToString()) = double(a)/double(b)
else false

// define function to find the greatest common dividor
let gcd a b = [2..min a b] |> List.rev |> Seq.filter (fun x -> a % x = 0 && b % x = 0) |> Seq.head

// define function that returns numbers >= n which are not multiples of 10
// and have two distinct digits (i.e. 11, 22 only have one distinct digits)
let numbers n = [n..99] |> List.filter (fun x -> x % 10 <> 0 && (x % 10 <> x/10))

// first work out the product of all 4 fractions, in fractions form (num, denom)
let fraction =
numbers 10
|> List.collect (fun x -> numbers (x+1) |> List.map (fun y -> (x, y)))
|> List.filter (fun (x, y) -> isCancelling x y)
|> List.reduce (fun (num, denom) (x, y) -> (num*x, denom*y))
// then define the denominator by the greatest common divisor
(snd fraction) / gcd (fst fraction) (snd fraction)
```
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}