Prime Factorization
12345678910111213141516171819202122232425262728
class Main {
public static void main(String[] args) {
long x;
long z = 0L;
long y = 600851475143L;
for(long i = 1; i <= y; i++) {
if(isPrime(i) && y % i == 0) {
x = i;
y /= i;
System.out.println(i);
}
}
}
public static boolean isPrime(long n) {
// n less than 1 is not prime
if(n <= 1) return false;
else if(n < 4) return true;
else {
if(n % 2 == 0) return false;
long sqrt = (int) Math.sqrt(n);
for( long i = 3; i <= sqrt; i += 2) {
if( n % i == 0) return false;
}
return true;
}
}
}
Java
INFO