quick algo I wrote for Temple class to determine if a number is a power (if it can be written as q to the k)

ispower.java

public class MyClass {
    public static void main(String args[]) {
        
        int N=125;
        
        int q=2;
        
        double k=Math.floor( Math.log(N) );
        
        System.out.println("k is " + k);
        
        for (int j=1; j<=k; j++) {
            int result=q;
        
            for(int i=1; i<=N/2; i++){
                result= result*q;
                if(result == N){
                    i++;
                    System.out.println("N is a power with q and k:" + q + ", " + i);
                    break;
                    }
            }
            q++;
        }
        
    }
}