Project Euler #3: Largest prime factor

  • + 0 comments
            long factor = 2;
            while(factor*factor<=n){
                if(n%factor==0){
                    n /= factor;
                }else{
                    factor++;
                }
            }
            System.out.println(n);
        }