Day 2 Assignment Submission

day2/ArmstrongNumber.java

@@ -0,0 +1,51 @@
+package day2;
+import java.util.Scanner;
+
+public class ArmstrongNumber {
+
+
+		static boolean isArmstrong(int n)   
+		{   
+		int temp, digits=0, last=0, sum=0;   
+
+		temp=n;   
+
+		while(temp>0)    
+		{   
+		temp = temp/10;   
+		digits++;   
+		}   
+		temp = n;   
+		while(temp>0)   
+		{   
+
+		last = temp % 10;   
+
+		sum +=  (Math.pow(last, digits));   
+
+		temp = temp/10;   
+		}  
+
+		if(n==sum)   
+
+		return true;      
+
+		else return false;   
+		}   
+
+		public static void main(String args[])     
+		{     
+		int num;   
+		Scanner sc= new Scanner(System.in);  
+		System.out.print("Enter the limit: ");  
+
+		num=sc.nextInt();  
+		System.out.println("Armstrong Number up to "+ num + " are: ");  
+		for(int i=0; i<=num; i++)  
+
+		if(isArmstrong(i))  
+
+		System.out.print(i+ ", ");  
+	}
+
+}

day2/AutomorphicNumber.java

@@ -0,0 +1,30 @@
+package day2;
+import java.util.Scanner;
+
+public class AutomorphicNumber {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+        Scanner in = new Scanner(System.in);
+        System.out.println("Enter a number");
+        int num = in.nextInt();
+
+        int c=0, sqr = num*num;
+        int temp =num; 
+
+
+        while(temp>0){
+            c++;
+            temp=temp/10;
+        }
+
+        int lastSquareDigits = (int) (sqr%(Math.pow(10,c)));
+
+        if(num == lastSquareDigits)
+            System.out.println("Automorphic number");
+        else
+            System.out.println("Not an Automorphic number");
+
+	}
+
+}

day2/FactorialProgramme.java

@@ -0,0 +1,18 @@
+package day2;
+
+public class FactorialProgramme {
+
+	public static void main(String[] args) {
+	 	int n=5,fact=1;
+
+        for(int i=1;i<=n;i++)
+  	  {
+
+    	   fact=fact*i;
+	 	  }
+
+	        System.out.println("factoral="+fact);
+
+	}
+
+}

day2/FibonacciSeries.java

@@ -0,0 +1,22 @@
+package day2;
+
+public class FibonacciSeries {
+
+
+		// TODO Auto-generated method stub
+		public static void main(String args[])  
+		{    
+		 int n1=0,n2=1,n3,i,count=10;    
+		 System.out.print(n1+" "+n2);  
+
+		 for(i=2;i<count;++i)   
+		 {    
+		  n3=n1+n2;    
+		  System.out.print(" "+n3);    
+		  n1=n2;    
+		  n2=n3;    
+		 }    
+
+	}
+
+}

day2/ForLoop.java

@@ -0,0 +1,12 @@
+package day2;
+
+public class ForLoop {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+      for(int i =0;i<5;i++) {
+    	  System.out.println(i);
+      }
+	}
+
+}

day2/NthPrimeNumber.java

@@ -0,0 +1,30 @@
+package day2;
+import java.util.Scanner;
+
+public class NthPrimeNumber {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+	    System.out.print("Enter n to compute the nth prime number: ");
+	    int nth = sc.nextInt(); 
+	    int num, count, i;
+	    num=1;
+	    count=0;
+
+	    while (count < nth){
+	      num=num+1;
+	      for (i = 2; i <= num; i++){ //Here we will loop from 2 to num
+	        if (num % i == 0) {
+	          break;
+	        }
+	      }
+	      if ( i == num){//if it is a prime number
+	        count = count+1;
+	      }
+	    }
+	    System.out.println("Value of nth prime: " + num);
+
+	}
+
+}

day2/PalindromeNum.java

@@ -0,0 +1,28 @@
+package day2;
+
+import java.util.Scanner;
+
+public class PalindromeNum {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc=new Scanner(System.in);
+		System.out.println("enter the number");
+		int n=sc.nextInt();
+		  int r,sum=0,temp;    
+
+
+		  temp=n;    
+		  while(n>0){    
+		   r=n%10;  //getting remainder  
+		   sum=(sum*10)+r;    
+		   n=n/10;    
+		  }    
+		  if(temp==sum)    
+		   System.out.println("palindrome number ");    
+		  else    
+		   System.out.println("not palindrome");   
+
+	}
+
+}

day2/PerfectSquare.java

@@ -0,0 +1,26 @@
+package day2;
+
+import java.util.Scanner;
+
+public class PerfectSquare {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc=new Scanner(System.in);
+		System.out.println("enter the number");
+		int number=sc.nextInt();
+
+
+
+	            int sqrt = (int) Math.sqrt(number);
+	            if (sqrt * sqrt == number) {
+	                System.out.println("this is the perfect square "+number+ " = "+sqrt+"*"+sqrt);
+	            } 
+	            else {
+	            	 System.out.println("this is not perfect square ");
+	            }
+	        }
+
+	}
+
+

day2/PrimeNumber.java

@@ -0,0 +1,29 @@
+package day2;
+import java.util.Scanner;
+
+public class PrimeNumber {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc=new Scanner(System.in);
+		System.out.println("enter the number");
+		int n=sc.nextInt();
+		 int i,m=0,flag=0;      
+
+		  m=n/2;      
+		  if(n==0||n==1){  
+		   System.out.println(n+" is not prime number");      
+		  }else{  
+		   for(i=2;i<=m;i++){      
+		    if(n%i==0){      
+		     System.out.println(n+" is not prime number");      
+		     flag=1;      
+		     break;      
+		    }      
+		   }      
+		   if(flag==0)  { System.out.println(n+" is prime number"); }  
+		  }
+         }
+	}
+
+

day2/ReverseNumber.java

@@ -0,0 +1,31 @@
+package day2;
+
+import java.util.Scanner;
+
+public class ReverseNumber {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc=new Scanner(System.in);
+		System.out.println("enter the number");
+		int number=sc.nextInt();
+		 int reversed = 0;
+
+		    System.out.println("Original Number: " + number);
+
+
+		    while(number != 0) {
+
+
+		      int digit = number % 10;
+		      reversed = reversed * 10 + digit;
+
+
+		      number /= 10;
+		    }
+
+		    System.out.println("Reversed Number: " + reversed);
+
+	}
+
+}

day2/SquareRootWithoutSqrtfun.java

@@ -0,0 +1,29 @@
+package day2;
+import java.util.Scanner;
+
+public class SquareRootWithoutSqrtfun {
+    public static double squareRoot(int number) {
+	double temp;
+
+	double sr = number / 2;
+
+	do {
+		temp = sr;
+		sr = (temp + (number / temp)) / 2;
+	} while ((temp - sr) != 0);
+
+	return sr;
+    }
+
+    public static void main(String[] args)  
+    { 
+	System.out.print("Enter any number:");
+	Scanner scanner = new Scanner(System.in);
+	int num = scanner.nextInt(); 
+	scanner.close();
+
+	System.out.println("Square root of "+ num+ " is: "+squareRoot(num));
+    } 
+
+
+}

day2/package-info.java

@@ -0,0 +1 @@
+package day2;