File: project_euler_047.pl

package info (click to toggle)
libmath-prime-util-perl 0.73-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 2,796 kB
  • sloc: perl: 24,676; ansic: 11,471; makefile: 26; python: 24
file content (9 lines) | stat: -rw-r--r-- 343 bytes parent folder | download | duplicates (4) 
1
2
3
4
5
6
7
8
9
 
#!/usr/bin/env perl
use warnings;
use strict;
use Math::Prime::Util qw/:all/;

my $n = pn_primorial(4);  # Start with the first 4-factor number
# factor_exp in scalar context returns the number of distinct prime factors
$n++ while (factor_exp($n) != 4 || factor_exp($n+1) != 4 || factor_exp($n+2) != 4 || factor_exp($n+3) != 4);
print "$n\n";