/* Prime Fibonnaci Problem Description: Given two numbers n1 and n2 1. Find prime numbers between n1 and n2, then 2. Make all possible unique combinations of numbers from the prime numbers list you found in step 1. 3. From this new list, again find all prime numbers. 4. Find smallest (a) and largest (b) number from the 2nd generated list, also count of this list. 5. Consider smallest and largest number as the 1st and 2nd number to generate Fibonacci series respectively till the count (number of primes in the 2nd list). 6. Print the last number of a Fibonacci series as an output Example : Input 30 70 Output 2027041 Explanation 1st prime list=[31, 37, 41, 43, 47, 53, 59, 61, 67] 2nd prime list generated form combination of 1st prime list = [3137, 5953, 5347, 6761, 3761, 4337, 6737, 6131, 3767, 4759, 4153, 3167, 4159, 6143] smallest prime in 2nd list=3137 largest prime in 2nd list=6761 Therefore, the last number of a Fibonacci series i.e. 14th Fibonacci number in the series that has 3137 and 6761 as the first 2 numbers is 2027041 */ import java.util.Scanner; import java.util.ArrayList; import java.util.Collections; public class Program { public static void main(String[] args) { Scanner s = new Scanner(System.in); ArrayListlist= new ArrayList<>(); ArrayListlist2= new ArrayList<>(); int num1= s.nextInt(); int num2= s.nextInt(); for(int n= num1; n<=num2;n++) { int count=0; for(int i=1;i<=n;i++) { if(n%i==0) { count++; } } if (count==2) { list.add(n); } } System.out.println("prime numbrs of list1"+":"+list); for(int i=0;i<=list.size()-1;i++) { for(int k=0;k<=list.size()-1;k++) { int a=list.get(i); int b=list.get(k); String t=Integer.toString(a); String s1=Integer.toString(b); String res=t+s1; int result=Integer.parseInt(res); int count2=0; for(int j=1;j<=result;j++) { if (result%j==0) { count2++; } } if(count2==2) { list2.add(result); } } } System.out.println("prime numbers of list2"+":"+list2); int one=Collections.min(list2);// or min(list2,null) int two=Collections.max(list2);// or max(list2,null) System.out.println("small no. :"+ one); System.out.println("large no. :"+ two); for(int i=1; i<=list2.size()-2;i++) { int c= one+two; one=two; two=c; if(i==list2.size()-2) { System.out.println(c); } } } }

tcs