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

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

diff --git a/extra/project-euler/148/148.factor b/extra/project-euler/148/148.factor
index 614353d548ee1f83247002e4d3bdf55f70e2e952..2e34abe038397df8c1039649951354e962d6ce57 100644 (file)
--- a/extra/project-euler/148/148.factor
+++ b/extra/project-euler/148/148.factor
@@ -1,15 +1,16 @@
 ! Copyright (c) 2008 Eric Mertens.
 ! See https://factorcode.org/license.txt for BSD license.
-USING: kernel math math.functions sequences project-euler.common ;
+USING: kernel math math.functions sequences project-euler.common
+;
 IN: project-euler.148
 
-! https://projecteuler.net/index.php?section=problems&id=148
+! https://projecteuler.net/problem=148
 
 ! DESCRIPTION
 ! -----------
 
-! We can easily verify that none of the entries in the first seven rows of
-! Pascal's triangle are divisible by 7:
+! We can easily verify that none of the entries in the first
+! seven rows of Pascal's triangle are divisible by 7:
 
 !                             1
 !                         1       1
@@ -19,11 +20,11 @@ IN: project-euler.148
 !         1       5      10      10       5       1
 !    1        6      15      20      15       6       1
 
-! However, if we check the first one hundred rows, we will find that only 2361
-! of the 5050 entries are not divisible by 7.
+! However, if we check the first one hundred rows, we will find
+! that only 2361 of the 5050 entries are not divisible by 7.
 
-! Find the number of entries which are not divisible by 7 in the first one
-! billion (10^9) rows of Pascal's triangle.
+! Find the number of entries which are not divisible by 7 in the
+! first one billion (10^9) rows of Pascal's triangle.
 
 
 ! SOLUTION