We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e8aada5 commit 7892341Copy full SHA for 7892341
src/main/java/com/thealgorithms/maths/GoldbachConjecture.java
@@ -41,7 +41,7 @@ public static void main(String[] args) {
41
int n = scanner.nextInt();
42
int flag = 0;
43
44
- if(n%2 == 0 && n>2) {
+ if(n % 2 == 0 && n > 2) {
45
for(int i = 0; i <= n/2 && flag == 0; i++)
46
if(isPrime(i))
47
if(isPrime(n - i))
0 commit comments