Excercise 2

21) Least Common Multiple

let number1 = 8
let number2 = 10

let minNumber = (number1<number2?number1:number2);
let maxNumber = (number1>number2?number1:number2);

while(true)
{

if(number2%minNumber == 0)
{
    document.write(parseInt(number2));
    break;
}

number2 = number2+maxNumber;

}

Output : 40

22) 2 power 5

let number = 2;
let power = 5;

document.write(number**5);

Output : 32

25) Fibonacci Series

let firstNumber = 0
let secondNumber = 1
let str = "";

str = firstNumber+","+secondNumber+","

for(let i =0; i<=10; i++)
{
    total = firstNumber+secondNumber; 
        str = str+total+","

    firstNumber = secondNumber; 
    secondNumber = total;
}
document.write(str.slice(0,-1));

26) Swapping two numbers

let firstNumber = 3;
let secondNumber = 5;
let temp = 0;

temp = firstNumber;
firstNumber = secondNumber;
secondNumber = temp

document.write("firstNumber : "+firstNumber+"<br>");
document.write("secondNumber: "+secondNumber);

27) Swapping without third variable

let firstNumber = 3;
let secondNumber = 5;

document.write("Before Swapping firstNumber : "+firstNumber+"<br>");
document.write("Before Swapping secondNumber : "+secondNumber+"<br>");

firstNumber = firstNumber+secondNumber; //8
secondNumber = firstNumber - secondNumber; // 3
firstNumber = firstNumber - secondNumber; //5

document.write("After Swapping firstNumber : "+firstNumber+"<br>");
document.write("After Swapping secondNumber : "+secondNumber+"<br>");

28) Fibonacci without using third variable

let firstNumber = 0;
let secondNumber = 1;

document.write(firstNumber+",");
document.write(secondNumber+",");

for(let i=0;i <=10; i++)
{

    firstNumber = firstNumber+secondNumber; //0+1 =1 
    document.write(firstNumber+","); //1 
    secondNumber = firstNumber+secondNumber;  // 1+1 = 2
    document.write(secondNumber+",");


}
Output : 0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711,28657,

30) First 10 Prime Numbers

let count = 1;
let str = "";

        for (let i = 2; i <= 100; i++) {
            let isPrime = true;

            for (let j = 2; j < i; j++) {
                if (i % j == 0)
                    isPrime = false
            }
            if (isPrime && count<=10){
                str = str+i+",";
                count++;
            }


        }

        document.write(str.slice(0,-1));

Output : 2,3,5,7,11,13,17,19,23,29

29) Odd Positions - Even Positions

let oddPositions = "";
let evenPositions = "";
for(let i = 1;i<=100;i++)
{
if(i%2 == 0)
evenPositions = evenPositions+i+",";
else
oddPositions = oddPositions+i+",";
}

document.write("Odd Positions : "+oddPositions.slice(0,-1)+"<br>");
document.write("Even Positions : "+evenPositions.slice(0,-1));

Output : 
Odd Positions : 1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,91,93,95,97,99
Even Positions : 2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,88,90,92,94,96,98,100

31) Sum of Digits until it becomes single digit

let number = 984567;
let total;
let temp =0;
while(number>10)
{
 total = 0;
while(number>0)
{

 total = total+ (number%10);
 number = parseInt(number/10);
}
    number = total;
}
    document.write(total)

Output : 3

32) Printing 5! 4! 3! 2! 1!

let printFactorial;
for(let i=5; i>=1; i--)
{
    printFactorial = 1;
for(let j = 1; j<=i; j++)
{

printFactorial = printFactorial*j;

}
document.write(`Factorial of ${i} :`+ printFactorial+"<br>");
}

Output : 
Factorial of 5 :120
Factorial of 4 :24
Factorial of 3 :6
Factorial of 2 :2
Factorial of 1 :1

32) Printing 5! 4! 3! 2! 1! using function recursion:

for(let i = 5; i>=1; i--)
{
    console.log(`factorial of ${i} :`+factorial(i));
}

function factorial(i)
{
    if(i==1)
        return 1;
    else
        return i*factorial(i-1);
}

Output :
factorial of 5 :120
factorial of 4 :24
factorial of 3 :6
factorial of 2 :2
factorial of 1 :1

33) Printing 1*10 2*9 3*8 4*7

let number = 10;

for(let i=1; i<=10; i++)
{

document.write(`${i} * ${number} : `+i*number+"<br>");
number--;

}

34) Printing 1 11 121

let number = 11;
for(let i=0; i<=5; i++)
{
document.write((number**i) + " ");

}

Output : 1 11 121 1331 14641 161051

35) Printing 1 8 27 64

let power = 3;
for(let i =1; i<=5; i++)
{
    document.write(i**power+" ");
}

Output : 1 8 27 64 125

36) Printing 1 4 9 16 25 36 49 64 81 100

for(let i =1; i<=10; i++)
{
    document.write(i*i+" ");
}

Printing 1 4 27 256

for(let i =1; i<=5; i++)
{
    document.write(i**i+" ");
}

38) Square Root of a Number

let number = 16
for(let i =2; i<=number; i++)
{
    if(number%i ==0 && number == i*i)
    {
    document.write(i);
    break;
    }
}
Output : 4

39) Spy Number

let number = 1124
let addition =0;
let multiplication = 1;
while(number>0)
{
addition = addition+(number%10);
multiplication = multiplication*(number%10);
number = parseInt(number/10);
}
if(addition ==multiplication )
document.write("Given number is a Spy number. Addition of digit is "+addition+ ".Multiplication of Digit is "+multiplication+".");
else
document.write("Given number is not a Spy number");

Output : Given number is a Spy number. Addition of digit is 8.Multiplication of Digit is 8.

40) Prime no.s in a fibonacci series

let firstNumber = 0
let secondNumber = 1
let str = "";
let primeNumber = "";
let isPrime;

str = firstNumber+","+secondNumber+","


for(let i =0; i<=10; i++)
{
    isPrime = true;
    total = firstNumber+secondNumber; 
    str = str+total+","

        for(let j =2; j<total; j++)
        {
        if(total%j ==0){
            isPrime = false;
            break;}
        }
        if(isPrime)
        primeNumber = primeNumber+total+" ";

    firstNumber = secondNumber; 
    secondNumber = total;
}

document.write("Fibonacci Series : ")
document.write(str.slice(0,-1));
document.write("<br>")
document.write("Primt Number in Fibonacci Series : ")
document.write(primeNumber);

Output : 

Fibonacci Series : 0,1,1,2,3,5,8,13,21,34,55,89,144
Primt Number in Fibonacci Series : 1 2 3 5 13 89