From 90ee38953d70b66aa78b5d09da53a63d3dba9f65 Mon Sep 17 00:00:00 2001 From: Charles Date: Wed, 4 Sep 2019 14:51:49 +0200 Subject: problem 044 haskell, some wip --- haskell/wip/026-reciprocal_cycles.hs | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 haskell/wip/026-reciprocal_cycles.hs (limited to 'haskell/wip/026-reciprocal_cycles.hs') diff --git a/haskell/wip/026-reciprocal_cycles.hs b/haskell/wip/026-reciprocal_cycles.hs new file mode 100644 index 0000000..f60920f --- /dev/null +++ b/haskell/wip/026-reciprocal_cycles.hs @@ -0,0 +1,24 @@ +-- Reciprocal cycles +-- +-- Problem 26 +-- A unit fraction contains 1 in the numerator. The decimal representation of the unit +-- fractions with denominators 2 to 10 are given: +-- +-- 1/2 = 0.5 +-- 1/3 = 0.(3) +-- 1/4 = 0.25 +-- 1/5 = 0.2 +-- 1/6 = 0.1(6) +-- 1/7 = 0.(142857) +-- 1/8 = 0.125 +-- 1/9 = 0.(1) +-- 1/10 = 0.1 +-- Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen +-- that 1/7 has a 6-digit recurring cycle. +-- +-- Find the value of d < 1000 for which 1/d contains the longest recurring cycle in +-- its decimal fraction part. + + +main = do + print () -- cgit