Name: Anonymous 2010-08-02 19:20
class prob3{
static long BigBossPrimeOne;
public static void primeFactor(long n){
boolean prime = true;
long n1=0;
long n2=0;
for(long i=2;(i<=(n/2))&&(prime!=false);i++)
if ((n%i)==0){
prime = false;
n1=i;
n2=n/i;
}
if ((prime==true)&&(n>BigBossPrimeOne))
BigBossPrimeOne = n;
if (prime==false){
primeFactor(n1);
primeFactor(n2);
}
}
public static void main(String args[]){
primeFactor(600851475143L);
System.out.println(BigBossPrimeOne);
}
}I'm just doing the Euler thing to pass the time and I thought why not post this on /prog/ for some insight.
Using the Java language.
Feel free to give me any advice.
Thanks!
Please don't mind the presentation. It's the first time using Emacs and I was under the clock (did this in 15 minutes).