214 Totient Chains.pl

#!/usr/bin/perl

# Daniel "Trizen" Șuteu
# Date: 03 October 2017
# https://github.com/trizen

# https://projecteuler.net/problem=214

# Runtime: 12.672s

use 5.010;
use strict;
use warnings;

use ntheory qw(euler_phi forprimes);

my $sum = 0;
my $chain_len = 25;

forprimes {

    my $len = 1;

    for (my $n = $_ - 1 ; ; $n = euler_phi($n)) {
        last if ++$len > $chain_len;
        last if $n == 1;
    }

    if ($len == $chain_len) {
        $sum += $_;
    }

} 40000000;

say $sum;