How to decompose a positive integer into factorization multiplication (Java)

 PackageCom.hpu.bai;/*** This program is used to decompose a positive integer into factorization multiplied by a = 2*2*5;@authorBai **/ Public classByprime { Public Static intPrimeintm) {            intK = 2;intCount =0; System.out.print (M+"=");  while(k<=m) {                if(k = =m)                    {System.out.print (M); Count+=1;  Break; }Else                if(M%k ==0) {System.out.print (k+"*"); Count+=1; M= m/K; }Else{k++; }    }            returncount;} Public Static voidMain (string[] args) {intCount = Prime (29); if(Count ==1) {System.out.println ("This is a prime number"); }ElseSystem.out.println ("This is a composite");}} AC QQ623687677 java Beginner

How to decompose a positive integer into factorization multiplication (Java)