namespace tasks;
///
/// Here you should implement the Sieve of Eratosthenes algorithm to find all prime numbers up to a given upper bound.
///
public static class PrimeFinder
{
public static IEnumerable SieveOfEratosthenes(int upperBound)
{
throw new NotImplementedException();
}
}