-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgenerate.pl
70 lines (48 loc) · 1.03 KB
/
generate.pl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#!/usr/bin/perl
# https://oeis.org/draft/A306479
use 5.014;
use ntheory qw(factor_exp vecprod forcomb forprimes vecmin is_square_free is_prime vecall factor);
sub rad {
my ($n) = @_;
vecprod(map{$_->[0]}factor_exp($n));
}
my %table;
forprimes {
push @{$table{rad($_-1)}}, $_;
} 1e7;
say "Done sieving...";
#foreach my $rad (keys %table) {
while (my ($rad, $arr) = each %table) {
my @v = @$arr;
@v >= 2 or next;
forcomb {
my $prod = vecprod(@v[@_]);
if (rad($prod-1) == $rad) {
say $prod;
}
} scalar(@v), 2;
}
__END__
6031047559681
763546828801
1525781251
184597450297471
732785991945841
var table = Hash()
for p in (primes(781210)) {
table{p-1 -> rad} := [] << p
}
for p,v in (table) {
var t = Num(p)
var len = v.len
#say "Testing: #{p} -> #{len}"
#len = 10 if (len > 10)
for k in (2..2) {
combinations(v, k, {|*a|
if (a.prod - 1 -> rad == t) {
say a.prod
}
})
}
}
#say table{6510}