Hello everyone.I have just joined the forum. Kindly help me with the source code to find the largest prime factor of a 12-digit number. HTML: import java.io.*; import java.util.Scanner; class primefactor { public static void main(String args[]) { try{ long num,i,j,count=0L,rem; long ans=0L; System.out.println("Enter the number whose greatest prime factor is required:"); Scanner sc=new Scanner(System.in); num=sc.nextLong(); for(i=1;i<=num;i++) { for(j=1;j<=i;j++) { if(i%j==0) count=count+1; } if(count==2) { rem=num%i; if(rem==0) ans=i; } count=0; } System.out.println("The answer is "+ ans);} catch(Exception e){System.out.println(e.getMessage());} } } Thank You
What do you mean? StackOverflow erro is thrown when a stack overflow occurs because an application recurses too deeply.