Shulou(Shulou.com)06/02 Report--

Editor to share with you how to decompose the prime factor of java, I believe that most people do not know much about it, so share this article for your reference, I hope you can learn a lot after reading this article, let's go to understand it!

Topic: decompose a positive integer into prime factors. For example, enter 90 to print out 90=2x3 x3 x5.

Program analysis: to decompose the prime factor of n, we should first find a minimum prime number k, and then follow the following steps:

(1) if the prime number is exactly equal to n, then the process of decomposing the prime factor is over and can be printed out.

(2) if nk, but n is divisible by k, then print out the value of k and divide n by the quotient of k as the new positive integer n, repeat the first step.

(3) if n is not divisible by k, the first step is repeated by using kapp1 as the value of k.

Package who

Import java.util.Scanner

/ * *

Decomposition prime factor

@ author jition

/

Public class PrimeFactorDecompositon {

Public static void main (String [] args) {

System.out.println ("enter a positive integer:")

Scanner sc = new Scanner (System.in)

Int n = sc.nextInt ()

Int flag = 0

/ / the minimum prime factor is 2

Int k = 2

System.out.print (n + "=")

If (n)

= k) {

If (k = = n) {

System.out.print (k)

Break

} else if (n% k = = 0) {

System.out.print (k + "")

N = n / k

} else {

Kicking +

}

}

}

}

The above is all the contents of the article "how to decompose the prime factor of java". Thank you for reading! I believe we all have a certain understanding, hope to share the content to help you, if you want to learn more knowledge, welcome to follow the industry information channel!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.