Project Euler — Problem 71 Solution

Problem

Consider the fraction, n/d, where n and d are positive integers. If n < d and HCF(n,d)=1, it is called a reduced proper fraction.

If we list the set of reduced proper fractions for d <= 8 in ascending…

Project Euler — Problem 65 Solution

Problem

The square root of 2 can be written as an infinite continued fraction.

The infinite continued fraction can be written, ?2 = [1;(2)], (2) indicates that 2 repeats ad infinitum. In a similar way, ?23 =…

F# — Adding custom indexer and slicer to your type

Indexer

If your have a type that represents a collection of values, adding a custom indexer gives you a natural way to index directly into the object using the .[ ] operator.