aboutsummaryrefslogtreecommitdiff
path: root/haskell/wip/026-reciprocal_cycles.hs
diff options
context:
space:
mode:
authorCharles <sircharlesaze@gmail.com>2019-09-04 14:51:49 +0200
committerCharles <sircharlesaze@gmail.com>2019-09-04 14:51:49 +0200
commit90ee38953d70b66aa78b5d09da53a63d3dba9f65 (patch)
tree6be4aea9cfac5908ad9e41304f112ece4b2249ba /haskell/wip/026-reciprocal_cycles.hs
parent08fddd1df75d4d9c76e7fa2e43c157232748abb6 (diff)
downloadproject_euler-90ee38953d70b66aa78b5d09da53a63d3dba9f65.tar.gz
project_euler-90ee38953d70b66aa78b5d09da53a63d3dba9f65.tar.bz2
project_euler-90ee38953d70b66aa78b5d09da53a63d3dba9f65.zip
problem 044 haskell, some wip
Diffstat (limited to 'haskell/wip/026-reciprocal_cycles.hs')
-rw-r--r--haskell/wip/026-reciprocal_cycles.hs24
1 files changed, 24 insertions, 0 deletions
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 ()