Hi Friend,

Try the following code:

import java.util.*;

public class PrimeAndFibbonacci {
int no;
private ArrayList<Integer> list = new ArrayList<Integer>();
ArrayList<Integer> generateSeries(int num) {
int f1, f2 = 0, f3 = 1;
for (int i = 1; i <= num; i++) {
list.add(f3);
f1 = f2;
f2 = f3;
f3 = f1 + f2;
}
return list;
}
static boolean isPrime(int number){
boolean isPrime=false;
int i=(int) Math.ceil(Math.sqrt(number));
while (i>1){
if ((number!=i) && (number%i==0)){
isPrime=false;
break;
}
else if (!isPrime)
isPrime=true;
--i;
}
return isPrime;
}
public static void main(String[] args) {
ArrayList<Integer> palindromes=new ArrayList<Integer>();
PrimeAndFibbonacci pf=new PrimeAndFibbonacci();
palindromes=pf.generateSeries(500);
Iterator<Integer> iter=palindromes.iterator();
while (iter.hasNext()){
int reqNo=iter.next();
if (isPrime(reqNo))
System.out.println(reqNo);
}
}
}

Thanks