Program to check the input number is Prime or Not
import java.util.Scanner; class Code { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print(“Enter n value : “); int n = sc.nextInt(); int count=0; for (int i=1 ; i<=n ; i++) { if(n%i==0) count++; } if(count==2) System.out.println(“Prime Number”); else System.out.println(“Not a Prime Number”); } } |
Program to check the input number is Perfect or Not
import java.util.Scanner; class Code { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print(“Enter n value : “); int n = sc.nextInt(); int sum=0; for (int i=1 ; i<n ; i++) { if(n%i==0) { sum=sum+i; } } if(n==sum) System.out.println(“Perfect Number”); else System.out.println(“Not a Perfect Number”); } } |
Program to print Fibonacci series
import java.util.Scanner; class Code { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print(“Enter number of factors in series : “); int n = sc.nextInt(); int a=0, b=1, c; for (int i=1 ; i<=n ; i++) { System.out.print(a + ” “); c=a+b; a=b; b=c; } } } |