How to find the prime factors of large number in Java

1 Answer

0 votes
public class MyClass {
    static void printPrimeFactor(long n) {
        long div = 2;
        while (n != 0) {
            if (n % div != 0) {
                div = div + 1;
            }
            else {
                System.out.print(div + ", ");
                n = n / div;
                if (n == 1) {
                    break;
                }
            }
        }
        System.out.println();
    }
    public static void main(String args[]) {
        printPrimeFactor(100000000); 
        printPrimeFactor(700858674091L);
        printPrimeFactor(20948717480147L);
    }
}
  
  
  
/*
run:
  
2, 2, 2, 2, 2, 2, 2, 2, 5, 5, 5, 5, 5, 5, 5, 5, 
449, 1560932459, 
2293, 3011, 3034189, 

*/

 



answered Oct 15, 2023 by avibootz

Related questions

1 answer 109 views
1 answer 118 views
1 answer 178 views
1 answer 90 views
1 answer 99 views
1 answer 67 views
1 answer 119 views
...