JavaScript program task-1

1) 1 1 1 1 1

let output = " ";
for(let i=1;i<=5;i++){
    output +=" 1";
    }
console.log(output);

1 1 1 1 1

2) 1 2 3 4 5

let output = " ";
for(let i=1;i<=5;i++){
    output += i + " ";
    }
console.log(output);

1 2 3 4 5 

3)

let output = " ";
for(let i=1;i<=10;i++){
    if(i%2!=0){
    output += i + " ";
    }
}
console.log(output);

 1 3 5 7 9 

4)

let output = " ";
for(let i=3;i<=15;i++){
    if(i%3==0){
    output += i + " ";
    }
}
console.log(output);

3 6 9 12 15 

5) Multiples of 3 and 5

let output = " ";
for( let i=1;i<=50;i++){
    if((i%3==0)&&(i%5==0)){
        output +=i + " ";
    }
}
console.log(output);

 15 30 45 

6) Multiples of 3 or 5

let output = " ";
for( let i=1;i<=50;i++){
    if((i%3==0)||(i%5==0)){
        output +=i + " ";
    }
}
console.log(output);

 3 5 6 9 10 12 15 18 20 21 24 25 27 30 33 35 36 39 40 42 45 48 50 

7) Divisors of given number

let number=10;
for( let i=1; i<=20;i++){
    if(number%i==0){
        console.log(i);
    }
}

1
2
5
10

8) Count of Divisors of given number:

let number=10;
let count=0;
for( let i=1; i<=20;i++){
    if(number%i==0){
        //console.log(i);
        count++;

    }

}
 console.log(count);   

4

9) Prime Number:

let number=9;
let count=0;
for( let i=1; i<=number;i++){
    if(number%i==0){
        count++;
    }
}
if(count==2){
    console.log("Is a Prime number");

}else{
    console.log("Not a Prime");
}

Not a Prime

10) Reverse a Number:

let number=1234;
let answer=0;

while(number>0){
    let digit=number%10;
    answer=answer*10+digit;
    number=Math.floor(number/10);
}
console.log(answer);

4321