Looping practice

Smallest Divisor of a given number:

public class Smalldiv {
void add(int n) {
int div=2;
while(div<n) {
if(n%div==0) {
System.out.println(div + ” is a smallest divisor of given number”);
break;
}
div=div+1;
}
}
public static void main(String[] args) {
Smalldiv s1=new Smalldiv();
s1.add(25);
}

}

OUTPUT:

5 is a smallest divisor of given number

Square root of a given number:

public class Squareroot {
void add(int n) {
int div=2;
while(div<n) {
if (n/div==div) {
System.out.println(div + ” is a Square root of given number”);
break;
}
div=div+1;
}
}
public static void main(String[] args) {
Squareroot s1=new Squareroot();
s1.add(16);
}

}

OUTPUT:

4 is a Square root of given number

Reverse a program in a given Number:

public class Reverse { void rever(int num) {    int rev=0;     while(num>0) {         int rem=n%10;         rev=(rev*10)+rem;         num=num/10;     }     System.out.println(rev); }public static void main(String[] args) { Reverse r1 =new Reverse(); r1.rever(1234); }

}

OUTPUT:

4321 is a smallest divisor of given number

Armstrong Number:

public class Armstrongno {
void add(int n1) {
int armstrong=0;
int n2=n1;
while(n1>0) {
int rem=n1%10;
int power=rem*rem*rem;
armstrong=armstrong+power;
n1=n1/10;
}
if(n2==armstrong) {
System.out.println(armstrong);
}
else {
System.out.println(“Not a Armstrong”);
}
}
public static void main(String[] args) {
Armstrongno a=new Armstrongno();
a.add(153);
}

}

OUTPUT:

armstrong