Sieve of Eratosthenes

using System;
using System.Collections.Generic;
using System.Linq;

class FindPrimeNumbers
{
    static void Main()
    {
        List<int> numbers = new List<int>();
        List<int> prime = new List<int>();
        for (int i = 2; i <= 10000000; i++)
        {
            numbers.Add(i);
        }
        while (numbers.Count > 0)
        {
            prime.Add(numbers[0]);
            numbers.RemoveAll(a => a % numbers[0] == 0);
        }
    }
}