Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package Problem3;
- public class LargestPrimeFaktor
- {
- static long s = 600851475143L ;
- static long primefa = 0;
- public static void main(String[] args)
- {
- factor();
- System.out.print(primefa);
- }
- public static void factor()
- {
- for(long i = (int)Math.sqrt(s); i >=1 ; --i)
- {
- if(s % i == 0 && isPrime(i) == true)
- {
- primefa = i;
- break;
- }
- }
- }
- public static boolean isPrime(long n)
- {
- if (n <= 1)
- return false;
- for (int i = 2; i < Math.sqrt(n); i++)
- {
- if (n % i == 0)
- return false;
- }
- return true;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement