import org.junit.Test;
public class primeHalf {
public void half(int number) {
// 最小的质数就是2
int k = 2;
int n = number;
System.out.print(number + "= ");
while (k <= n) {
if (k == n) {
System.out.print(k);
break;
} else if (n % k == 0) {
System.out.print(k + " * ");
n = n / k;
continue;
} else {
k = k + 1;
}
}
}
@Test
public void test() {
half(90);
}
}