Repository navigation
Expand file tree
/
Copy pathtask-a02.ts
More file actions
80 lines (71 loc) · 1.52 KB
/
Copy pathtask-a02.ts
File metadata and controls
80 lines (71 loc) · 1.52 KB
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
71
72
73
74
75
76
77
78
79
80
// k * (k + 1) * ... * (2k - 1) * 2k
function calculateK(n: number): number {
let p = 1;
for (let i = n; i <= 2 * n; i++) {
p = p * i;
}
return p;
}
// n(n+m)(n+2m)...(n+mm)
function calculateNM(n: number, m: number): number {
let p = 1;
for (let i = 0; i <= m; i++) {
p *= n + i * m;
}
return p;
}
// (n+m)(n-2m)(n+3m)...(n+ (-1)^(m+1) m*m)
// n^e 3^4 = 3 * 3 * 3 * 3
function power(n: number, e: number): number {
let result = 1;
for (let i = 1; i <= e; i++) {
result *= n;
}
return result;
}
function calculateNM2(n: number, m: number): number {
let p = 1;
const signum = -1;
for (let i = 1; i <= m; i++) {
p *= n + power(signum, i + 1) * i * m;
// p *= n + (signum ** (i + 1)) * i * m;
}
return p;
}
// 1! + 2! + 3! + ... + n!
function fact(n: number): number {
let p = 1;
for (let i = 1; i <= n; i++) {
p *= i;
}
return p;
}
function sumFact(n: number): number {
let s = 0;
for (let i = 1; i <= n; i++) {
s += fact(i);
}
return s;
}
// perfect number 28 = 1+2+4+7+14
function perfect(n: number): boolean {
let s = 0;
for (let i = 1; i < n; i++) {
if (n % i === 0) {
s += i;
}
}
return s == n;
}
function firstNPerfect() {
for (let i = 1; i <= 100; i++) console.log('i = ', i, ' p ', perfect(i));
}
function run(): void {
console.log('Task a02');
// console.log(calculateK(4))
// console.log(calculateNM(2, 3))
// console.log(calculateNM2(2, 3));
// console.log(sumFact(6));
// console.log(perfect(28));
}
export default run;