GCD Program

rule – find the smallest.

smallest—-> big % smallest==0.

int no1=30,no2=15;
int small=no1<no2?no1:no2; // condition true ah iruntha no1 small….false ah iruntha no2 small.
int big=no1>no2?no1:no2; // condition true ah iruntha no1 big….false ah iruntha no2 big

if(big%small==0)
{
System.out.println(“GCD”+ small);
}

divisible of greatest no of the given 2 nos

int no1=100,no2=50;
int small=no1=2)
{
if((no1%small==0)&&(no2%small==0))
{
System.out.println(“GCD”+ small);
break;
}
small–;
}

divisible of greatest no of the given 2 nos………NO GCD PROGRAM

int no1=15,no2=16;
int small=no1=2)
{
if((no1%small==0)&&(no2%small==0))
{
common=false;
System.out.println(“GCD”+ small);
break;
}
small–;
}
if(common==true)
{
System.out.println(“no GCD”);
}

LCM————-> mee peru pogu vaguthi

int no1=49,no2=81;
int big=no1>no2?no1:no2;
int big2=big;
int small=no1<no2?no1:no2;
while(true)
{
if(big%small==0)
{
System.out.println(big);
break;
}
big+=big2;
}

decimal to binary number

int no=4; String rem=””;
while(no>0)
{
rem=no%2+rem; //rem+no%2 ah no%2+rem ah change panna
no=no/2;
}
System.out.println(rem);

binary to decimal number

int no=1001,power=0; int dec=0,rem=0;
while(no>0)
{
rem=no%10;
dec=dec+(int) (rem*Math.pow(2, power));
no=no/10;
power++;
}
System.out.println(dec);

print sum of sum in the given numbers

int no=12345,sum;
do
{
sum=0;
while(no>0)
{
int rem=no%10;
sum=sum+rem;
no=no/10;
}
no=sum;
}
while(sum>9);
System.out.println(sum);

armstrong no

int no=153; int no2=no;
int arm=0,rem=0;
while(no>0)
{
rem=no%10;
arm=arm+(remremrem);
no=no/10;
}
if(no2==arm)
{
System.out.println(“arm”);
}

Neon program

int no=9,sum=0,rem=0;
int square=no*no;
while(square>0)
{
rem=square%10;
sum=sum+rem;
square=square/10;
}
if(sum==no)
{
System.out.println(“neon”);
}

Perfect number program

            int sum=0;
int no=6;
for(int i=1;i<no;i++)
{
if(no%i==0)
sum=sum+i;
}
if(sum==no)
System.out.println("PERFECT");

fibonacci program

int first=0,second=1;
System.out.println(first);
System.out.println(second);
for(int i=2;i<=10;i++)
{
int third=first+second;
System.out.println(third);
first=second;
second=third;
}

fibonacci no entha place la irukku

int first=0,second=1;
int count=0;
while(true)
{
int third=first+second;
count++;
if(count==4)
{
System.out.println(third);
break;
}
first=second;
second=third;
}