using System.Collections.Generic;
namespace PrimesInGivenRange
static bool IsPrime(long n)
for (int i = 2; i <= Math.Sqrt(n); i++)
if (n % i == 0) return false;
static List<int> FindPrimesInRange(int startNum, int endNum)
List<int> primeNumbers = new List<int> { };
Console.WriteLine("(empty list)");
for (int i = startNum; i <= endNum; i++)
public static void Main()
Console.WriteLine("Program that calculates all prime numbers in given range and returns them as list of integers.");
Console.WriteLine("Write number to start the range");
int start = int.Parse(Console.ReadLine());
Console.WriteLine("Write number to end the range");
int end = int.Parse(Console.ReadLine());
List<int> range = Program.FindPrimesInRange(start, end);
Console.WriteLine("The prime numbers between {0} and {1} are:", start, end);
range.ForEach(Console.WriteLine);