using System;

using System.Collections.Generic;

using System.Linq;

​

/*

​

Write a method primes() which returns an array of the first n primes, where n is provided to the method as a parameter.

​

Remember that the % operator (modulo) is your friend.  It returns a zero if one number is divisible by another number.

​

In other words, 4 % 2 == 0.

​

*/

​

public class P {

    public static int[] primes(int n){

        List<int> result = new List<int>();

        int current = 1;

        while(result.Count < n){

            if(!result.Any(x => current % x == 0 && x != 1)) 

                result.Add(current);

            current++;

        }

        return result.ToArray();

    }

    public static void print(int[] r) => 

        Console.WriteLine("["+String.Join(",", r)+"]");

    public static void Main(){

        // primes(6) --> [1, 2, 3, 5, 7, 11];

        print( primes(0) );

        print( primes(1) );

        print( primes(2) );

        print( primes(3) );

        print( primes(6) );

    }

}

​

​