Write a Java program that takes a positive integer as input and performs prime factorization using a while loop. The program should display the prime factors of the given number.Ensure the program handles invalid input gracefully, providing appropriate messages

Sure, here is a simple Java program that performs prime factorization using a while loop:

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("Enter a positive integer:");
        int num = scanner.nextInt();

        // Check if the input is a positive integer
        if (num <= 0) {
            System.out.println("Invalid input. Please enter a positive integer.");
        } else {
            System.out.println("Prime factors of " + num + " are: ");
            // Loop through each number up to num
            for(int i = 2; i<= num; i++) {
                while(num%i == 0) {
                    System.out.println(i+" ");
                    num = num/i;
                }
            }
            if(num >1) {
                System.out.println(num);
            }
        }
    }
}

This program first checks if the input is a positive integer. If it is, it then loops through each number up to the input number. If the current number is a factor of the input number (i.e., the input number modulo the current number equals zero), it prints the current number and divides the input number by the current number. This process continues until the input number has been fully factorized. If the input number is not a positive integer, the program prints an error message.