X-Git-Url: https://gitweb.factorcode.org/gitweb.cgi?p=factor.git;a=blobdiff_plain;f=extra%2Fproject-euler%2F051%2F051.factor;h=73b6325b2cb56df1a9339f58b965cb7643d601d8;hp=514b9ca8313e7f4353b38e8665ae0393a4f74846;hb=96d543056491bfd71e65a093f4add5a6a5bb780d;hpb=6206ba5583b7616c59741963dbf01d8c9c88e223

diff --git a/extra/project-euler/051/051.factor b/extra/project-euler/051/051.factor
index 514b9ca831..73b6325b2c 100644
--- a/extra/project-euler/051/051.factor
+++ b/extra/project-euler/051/051.factor
@@ -26,7 +26,7 @@
 
 ! for each prime number, count the families it belongs to. When one reaches count of 8, stop, and get the smallest number by replacing * with ones.
 
-USING: assocs fry kernel math math.combinatorics math.functions
+USING: assocs kernel math math.combinatorics math.functions
 math.order math.parser math.primes ranges namespaces
 project-euler.common sequences sets ;
 IN: project-euler.051