using System.Collections.Generic;
public static void Main()
List<int> numbers = new List<int> { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17 };
var primeNumbers = numbers
.Where(n => PrimeNumberFinder.IsPrime(n))
foreach (var prime in primeNumbers)
Console.WriteLine(prime);
public class PrimeNumberFinder
public static bool IsPrime(int number)
if (number <= 1) return false;
if (number == 2) return true;
if (number % 2 == 0) return false;
var boundary = (int)Math.Floor(Math.Sqrt(number));
for (int i = 3; i <= boundary; i += 2)