Question

For a given integer n > 1, output its prime factorization.

(Please follow the format strictly)

Example:

n=8, output: 2^3

n=72, output: 2^3*3^2. (2^3 means 23)

In Java please

Answer 1

import java.util.Scanner;

public class PrimeFactorization {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        System.out.print("Enter a number: ");
        int n = in.nextInt();
        System.out.print(n + "=");
        for (int i = 2; i <= n; ++i) {
            int count = 0;
            while (n % i == 0) {
                n /= i;
                ++count;
            }
            if (count > 0) {
                System.out.print(i + "^" + count);
                if (n != 1) {
                    System.out.print("*");
                }
            }
        }
        System.out.println();
    }
}

Enter a number: 72 72=2^3*3^2 Process finished with exit code o