Wrong code

Computer Science Level 2

public class SumOfPrimes {
    public static void main(String[] args) {
        long sum = 0;
        for (int i = 2; i <= 1000; i++) {
            if (isPrime(i)) {
                sum += i;
            }
        }
        System.out.println(sum);
    }

    private static boolean isPrime(final int number) {
        for (int i = 2; i * i <= number; i++) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }
}

Above shows a java program. What is the positive integer output?

The answer is 76127.

2 solutions

Saksham Jain
Nov 18, 2017

I ran it in AIDE

Hasmik Garyaka
Oct 6, 2017

I run it in NetBeans

This is the wrong code to determine the sum of all prime numbers 1-1000. Do you know the correct code?

Munem Shahriar - 3 years, 8 months ago

It is not wrong, but not optimal. Optimal would be eratosphene siege.

Hasmik Garyaka - 3 years, 8 months ago

So do you mean sum of all prime numbers 1-1000 is 76127?

Munem Shahriar - 3 years, 8 months ago

@Munem Shahriar – It's not the first such question in community. I have this program.

Hasmik Garyaka - 3 years, 8 months ago

@Munem Sahariar I also think this is wrong code.To get correct output do not use i*I there instead use i

Saksham Jain - 3 years, 6 months ago

import java.util.Arrays;

int n; boolean[] primes = new boolean[n + 1];

public void fillSieve() { Arrays.fill(primes, true); primes[0] = primes[1] = false; for (int i = 2; i < primes.length; ++i) { if (primes[i]) { for (int j = 2; i * j < primes.length; ++j) { primes[i * j] = false; } } } }

Hasmik Garyaka - 3 years, 8 months ago

Where should I run this code? It doesn't work here

Munem Shahriar - 3 years, 8 months ago

In some IDE

Hasmik Garyaka - 3 years, 8 months ago

Wrong code

The answer is 76127.

2 solutions

0 pending reports