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

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

diff --git a/extra/project-euler/014/014.factor b/extra/project-euler/014/014.factor
index 49efd89ec22aee802031f300beec5840186cef07..0297644636a52779f72324d5f35ec58a425d8a77 100644 (file)
--- a/extra/project-euler/014/014.factor
+++ b/extra/project-euler/014/014.factor
@@ -1,31 +1,35 @@
 ! Copyright (c) 2007 Aaron Schaefer.
 ! See https://factorcode.org/license.txt for BSD license.
-USING: combinators.short-circuit kernel make math math.functions ranges
-    sequences project-euler.common ;
+USING: combinators.short-circuit kernel make math math.functions
+ranges sequences project-euler.common ;
 IN: project-euler.014
 
-! https://projecteuler.net/index.php?section=problems&id=14
+! https://projecteuler.net/problem=14
 
 ! DESCRIPTION
 ! -----------
 
-! The following iterative sequence is defined for the set of positive integers:
+! The following iterative sequence is defined for the set of
+! positive integers:
 
 !     n -> n / 2  (n is even)
 !     n -> 3n + 1 (n is odd)
 
-! Using the rule above and starting with 13, we generate the following
-! sequence:
+! Using the rule above and starting with 13, we generate the
+! following sequence:
 
 !     13 -> 40 -> 20 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1
 
-! It can be seen that this sequence (starting at 13 and finishing at 1)
-! contains 10 terms. Although it has not been proved yet (Collatz Problem), it
-! is thought that all starting numbers finish at 1.
+! It can be seen that this sequence (starting at 13 and
+! finishing at 1) contains 10 terms. Although it has not been
+! proved yet (Collatz Problem), it is thought that all starting
+! numbers finish at 1.
 
-! Which starting number, under one million, produces the longest chain?
+! Which starting number, under one million, produces the longest
+! chain?
 
-! NOTE: Once the chain starts the terms are allowed to go above one million.
+! NOTE: Once the chain starts the terms are allowed to go above
+! one million.
 
 
 ! SOLUTION