-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProblem3.java
More file actions
41 lines (35 loc) · 1.14 KB
/
Problem3.java
File metadata and controls
41 lines (35 loc) · 1.14 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
package problems;
/**
* Problem 3 - Largest prime factor
* <p>
* The prime factors of 13195 are 5, 7, 13 and 29.
* <p>
* What is the largest prime factor of the number 600851475143 ?
* <p>
* Prime number is a number that is greater than 1 and divided by 1 or itself only.
*/
public class Problem3 {
private static final long NUMBER = 600851475143L;
public static void main(String[] args) {
long current = 5;
long largest = current;
while (current++ < NUMBER) {
if (isPrime(current)) {
largest = current;
System.out.println(largest);
}
}
System.out.println("Largest prime factor of the number 600851475143 is " + largest);
}
//checks whether an int is prime or not.
private static boolean isPrime(long n) {
if (n < 2) return false;
if (n == 2 || n == 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
long sqrtN = (long) Math.sqrt(n) + 1;
for (long i = 6L; i <= sqrtN; i += 6) {
if (n % (i - 1) == 0 || n % (i + 1) == 0) return false;
}
return true;
}
}