-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFor_Loop.js
63 lines (52 loc) · 1.62 KB
/
For_Loop.js
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
//Que1-prints a table of the powers of 2
var readlineSync = require('readline-sync');
var range = readlineSync.question("Enter range to find power of two: ");
var sum = 1
for (var i = 1; i <= range; i++) {
sum = sum * 2;
}
console.log("Power of two table upto the range is: ", sum);
//Que2-Print the Harmonic Number
var n = parseInt(readlineSync.question("Enter a number :"));
var sum = 0;
for (var i = 1; i <= n; i++) {
sum = sum + (1 / i);
}
console.log("harmonic mean upto " + n + " = " + sum);
//Que3- Determines if the number is a prime or not
var number = parseInt(readlineSync.question("Enter a number :"));
let count = 0;
for (var i = 1; i <= number; i++) {
if (number % i == 0) {
count++;
}
}
if (count == 2) {
console.log("It is a Prime Number");
}
else {
console.log("It is not a Prime Number");
}
//Que4-Take a range from user and output the prime numbers in that range
var lowerrange = parseInt(readlineSync.question("Enter a lower range :"));
var higherrange = parseInt(readlineSync.question("Enter a higher range :"));
console.log("Prime Numbers between " + lowerrange + "to" + higherrange + "are");
for (var i = lowerrange; i <= higherrange; i++) {
let flag = 0;
for (var j = 2; j < i; j++) {
if (i % j == 0) {
flag = 1;
break;
}
}
if (i > 1 && flag == 0) {
console.log(i);
}
}
//Que5- Compute a factorial of a number taken as input
var number = parseInt(readlineSync.question("Enter a number :"));
let fact = 1;
for (var i = 1; i <= number; i++) {
fact = fact * i;
}
console.log("Factorial of " + number + " is :" + fact);