3_Largest_prime_factor.java

// Created July 2016

/*
import java.util.ArrayList;
import java.lang.*;
import java.math.BigDecimal;

public class 3_Largest_prime_factor {
	public static void main(String[] args) {
		ArrayList <Integer> factorList = new ArrayList<Integer>();
		BigDecimal count = new BigDecimal ("1"), num = new BigDecimal ("600851475143");
		
		while (count < num)) {
		}
	}
	public static boolean isPrime(int n) {
		if (n % 2 == 0)
			return false;
		for (int i = 3; i*i <= n; i += 2)
			if (n % i == 0)
				return false;
		return true;
	}

}
*/