project-euler: Rewrap, update links, add copyrights, tests

[factor.git] / extra / project-euler / 175 / 175.factor

diff --git a/extra/project-euler/175/175.factor b/extra/project-euler/175/175.factor
index 2f058c2989e58bb30953d92d3bb607b8028733e0..8e974609d9ee8ade40eaa6a8e9d5bb027be7d057 100644 (file)
--- a/extra/project-euler/175/175.factor
+++ b/extra/project-euler/175/175.factor
@@ -4,29 +4,32 @@ USING: combinators kernel math math.parser project-euler.common
 sequences ;
 IN: project-euler.175
 
-! https://projecteuler.net/index.php?section=problems&id=175
+! https://projecteuler.net/problem=175
 
 ! DESCRIPTION
 ! -----------
 
-! Define f(0) = 1 and f(n) to be the number of ways to write n as a sum of
-! powers of 2 where no power occurs more than twice.
+! Define f(0) = 1 and f(n) to be the number of ways to write n
+! as a sum of powers of 2 where no power occurs more than twice.
 
-! For example, f(10) = 5 since there are five different ways to express
-! 10: 10 = 8+2 = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1
+! For example, f(10) = 5 since there are five different ways to
+! express 10: 10 = 8+2 = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1
 
-! It can be shown that for every fraction p/q (p0, q0) there exists at least
-! one integer n such that f(n) / f(n-1) = p/q.
+! It can be shown that for every fraction p/q (p0, q0) there
+! exists at least one integer n such that f(n) / f(n-1) = p/q.
 
-! For instance, the smallest n for which f(n) / f(n-1) = 13/17 is 241. The
-! binary expansion of 241 is 11110001. Reading this binary number from the most
-! significant bit to the least significant bit there are 4 one's, 3 zeroes and
-! 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241.
+! For instance, the smallest n for which f(n) / f(n-1) = 13/17
+! is 241. The binary expansion of 241 is 11110001. Reading this
+! binary number from the most significant bit to the least
+! significant bit there are 4 one's, 3 zeroes and 1 one. We
+! shall call the string 4,3,1 the Shortened Binary Expansion of
+! 241.
 
-! Find the Shortened Binary Expansion of the smallest n for which
-! f(n) / f(n-1) = 123456789/987654321.
+! Find the Shortened Binary Expansion of the smallest n for
+! which f(n) / f(n-1) = 123456789/987654321.
 
-! Give your answer as comma separated integers, without any whitespaces.
+! Give your answer as comma separated integers, without any
+! whitespaces.
 
 
 ! SOLUTION