├── Palindrome.java
├── FibonacciSeries.java
└── PrimeNumber.java


/Palindrome.java:
--------------------------------------------------------------------------------
 1 | package org.test;
 2 | 
 3 | public class Palindrome {
 4 | public static void main(String[] args) {
 5 | 	int r,sum=0,temp;
 6 | 	int n=342;
 7 | 	
 8 | 	temp=n;
 9 | 	while(n>0) {
10 | 		r=n%10;
11 | 		sum=(sum*10)+r;
12 | 		n=n/10;
13 | 	}
14 | 	if(temp==sum)
15 | 		System.out.println("Palindrome Number");
16 | 	else
17 | 		System.out.println("Not a Palindrome");
18 | 	
19 | }
20 | }
21 | 


--------------------------------------------------------------------------------
/FibonacciSeries.java:
--------------------------------------------------------------------------------
 1 | package day8;
 2 | 
 3 | import java.util.Scanner;
 4 | 
 5 | public class FibonacciSeries {
 6 | public static void main(String[] args) {
 7 | 	Scanner sc = new Scanner (System.in);
 8 | 	System.out.println("Enter 1st integer: ");
 9 | 	int n1 = sc.nextInt();
10 | 	System.out.println("Enter 2nd integer: ");
11 | 	int n2 = sc.nextInt();
12 | 	System.out.println("Enter the count : ");
13 | 	int count = sc.nextInt();
14 | 	System.out.println(n1);
15 | 	System.out.println(n2);
16 | 	for (int i=2;i<count;i++) {
17 | 		int n3=0;
18 | 		n3 = n1 + n2;
19 | 		System.out.println(n3);
20 | 		n1=n2;
21 | 		n2=n3;
22 | 	}
23 | 	
24 | 	
25 | 			
26 | 	
27 | }
28 | }
29 | 


--------------------------------------------------------------------------------
/PrimeNumber.java:
--------------------------------------------------------------------------------
 1 | package org.test;
 2 | 
 3 | import java.util.Scanner;
 4 | 
 5 | public class PrimeNumber {
 6 | public static void main(String[] args) {
 7 | 	Scanner s = new Scanner(System.in);
 8 | 	System.out.println("Enter the first number: ");
 9 | 	int start = s.nextInt();
10 | 	System.out.println("Enter the second number: ");
11 | 	int end = s.nextInt();
12 | 	System.out.println("List of prime numbers between"+start+"and"+end);
13 | 	for (int i = start; i <=end; i++) {
14 | 		if (isPrime(i)) {
15 | 			System.out.println(i);
16 | 		}
17 | 	}
18 | 	
19 | 	
20 | }
21 | 
22 | private static boolean isPrime(int n) {
23 | 	if (n<=1) {
24 | 		return false;
25 | 	}
26 | 	for (int i = 2; i < Math.sqrt(n); i++) {
27 | 		if (n%i==0) {
28 | 			return false;
29 | 		}
30 | 	}
31 | 	return true;
32 | }
33 | }
34 | 


--------------------------------------------------------------------------------