blob: 12053a24454fdbfb8e378b4504318fa23f83dc50 (
plain)
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
|
#!/usr/bin/bc -ql
/*
Challenge 008
Challenge #1
Write a script that computes the first five perfect numbers. A perfect number
is an integer that is the sum of its positive proper divisors (all divisors
except itself). Please check Wiki for more information.
This challenge was proposed by Laurent Rosenfeld.
*/
scale = 0
num = read()
define is_prime(n) {
auto i
if (n <= 1) return 0
if (n <= 3) return 1
if ((n % 2) == 0 || (n % 3) == 0) return 0
for (i = 5; i*i <= n; i += 6) {
if ((n % i) == 0 || (n % (i + 2)) == 0) return 0
}
return 1
}
define next_prime(n) {
if (n <= 1) return 2
n = n+1
while (!is_prime(n)) n = n+1
return n;
}
p = 1
define next_perfect() {
auto f
while (1) {
p = next_prime(p)
f = (2 ^ p) - 1
if (is_prime(f)) return (2 ^ (p-1)) * f
}
}
for (i = 0; i < num; i++) {
print next_perfect(), "\n"
}
quit
|
