import java.math.*; 

public class SumOfPrimes2 
{ 

	public static void main(String[] args)
	{
		BigInteger sum = BigInteger.ZERO; 
		for (BigInteger num = BigInteger.ZERO; num.compareTo(BigInteger.valueOf(2000000)) < 0; num = num.nextProbablePrime()) 
		sum = sum.add(num); 
		System.out.println(sum.toString());
	} 
}

Fayimora:

wats your runtime nd result?

Ghenghis:

using System;
using System.Collections.Generic;

namespace Primes
{
    class Program
    {
        static void Main()
        {
            double total = 0;
            Console.Write("Enter max for check: ";
            double max = Convert.ToDouble(Console.ReadLine());
            for (double d = 2; d < max; d ++)
            {
               if(isPrime(d)) total += d;
            }
            Console.WriteLine("The total sum of prime numbers from 1 to {0} is : {1}", max, total + 1);
            Console.ReadLine();
        }

        private static readonly List<double> primes = new List<double>();

        static bool isPrime(double i)
        {
            foreach(double d in primes)
            {
                if(d <= (i/2))
                {
                    if ((i % d) == 0) return false;
                }
            }
            primes.Add(i);
            return true;
        }
    }
}

currentTimeMillis
public static long currentTimeMillis()
Returns the current time in milliseconds. Note that while the unit of time of the return value is a millisecond, the granularity of the value depends on the underlying operating system and may be larger. For example, many operating systems measure time in units of tens of milliseconds.
See the description of the class Date for a discussion of slight discrepancies that may arise between "computer time" and coordinated universal time (UTC).

Returns:
the difference, measured in milliseconds, between the current time and midnight, January 1, 1970 UTC.

Test Your Skill in using For Loop
Write a program to out put the pattern below

Input:[font=Lucida Sans Unicode][/font]
2

Output:

**********
**      * *
* *     *   *
*  ***********
*  *    *    *
*  *    *    *
*  *    *    *
*********    *
 * *      *  *
  **        **
   ***********

Input:
1

output:

**********
*        *
*        *
*        *
*        *
*        *
*        *
**********

For every integer input , the corresponding output should be drawn using asteriks.. Have fun

[/code]
[/quote][quote]
[code]

dell_net: Little cheat.

#include <windows.h>
#include <stdio.h>
#include <math.h>
void main()
{
	long sum, two_mil;
	two_mil = 10; /*change to 2 mil*/
	sum =0;
	bool prime;
	for (long x =2; x < two_mil; x++)
	{
		prime = false;
		for (long p = 2; p < x; p++)
		{
			if (fmod((double)x / (double)p,1)==0 && (x !=p))
				prime = true;
		}
		if(prime == false)
		sum+=x;
	}
	printf("%d\n", sum);
	system("pause";

}