## Description

**Stack to print the Prime Factors Java Program**

For a given integer n > 1, the smallest integer d > 1 that divides n is a prime factor. We can find the prime factorization of n if we find d and then replace n by the quotient of n divided by d, repeating this until n becomes 1.

Write a Java program that uses a stack (in Arrays) to print the prime factors of a positive integer in descending order.

For example, for n = 3960, the program should produce:

11*5*3*3*2*2*2

## Reviews

There are no reviews yet.