diff options
| -rwxr-xr-x | challenge-159/mattneleigh/perl/ch-1.pl | 4 | ||||
| -rwxr-xr-x | challenge-159/mattneleigh/perl/ch-2.pl | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/challenge-159/mattneleigh/perl/ch-1.pl b/challenge-159/mattneleigh/perl/ch-1.pl index 5015018128..e84ab5cd7a 100755 --- a/challenge-159/mattneleigh/perl/ch-1.pl +++ b/challenge-159/mattneleigh/perl/ch-1.pl @@ -56,8 +56,8 @@ sub calculate_farey_sequence{ [ 1, $n ] ); - # Loop until we see we have unity at the - # end of the sequence + # Loop until we have unity at the end + # of the sequence while($sequence[$#sequence][0] != $sequence[$#sequence][1]){ my $k = floor( ($n + $sequence[$#sequence - 1][1]) diff --git a/challenge-159/mattneleigh/perl/ch-2.pl b/challenge-159/mattneleigh/perl/ch-2.pl index a7376374ca..6702420488 100755 --- a/challenge-159/mattneleigh/perl/ch-2.pl +++ b/challenge-159/mattneleigh/perl/ch-2.pl @@ -35,7 +35,7 @@ exit(0); # * The Moebius number for N, which will be 0 if N has a squared prime factor, # 1 if N is square-free and has an even number of prime factors, and -1 if N # is square-free and has an odd number of prime factors -# Returns on failure: +# Returns on error: # * undef if N is less than 1 ################################################################################ sub calculate_moebius_number{ |