Harmonize spelling

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

diff --git a/extra/project-euler/070/070.factor b/extra/project-euler/070/070.factor
index 09f10986552b3bdb5e7a241d92a9e1533a1819b7..07e45fff3d50c69fb93e49af624bca19a6112801 100644 (file)
--- a/extra/project-euler/070/070.factor
+++ b/extra/project-euler/070/070.factor
@@ -29,7 +29,7 @@ IN: project-euler.070
 ! --------
 
 ! For n/φ(n) to be minimised, φ(n) must be as close to n as possible; that is,
-! we want to maximise φ(n). The minimal solution for n/φ(n) would be if n was
+! we want to maximize φ(n). The minimal solution for n/φ(n) would be if n was
 ! prime giving n/(n-1) but since n-1 never is a permutation of n it cannot be
 ! prime.