Sieve of Eratosthenes - An algorithm to find prime number

SieveOfEratosthenesOnPrime.cs

public static class SieveOfEratos {
        private static int[] GenerateArray(int n) => Enumerable.Range(2, n-1).ToArray(); // generate from 2 -> n
        private static bool[] GenerateArrayOfOnes(int n) => Enumerable.Repeat(true, n).ToArray();
        public static int[] SieveofEratosAlgorithm(int upperLimited)
        {
            int[] allNumbers = GenerateArray(upperLimited);
            bool[] allMarker = GenerateArrayOfOnes(allNumbers.Length);
            int maxValue = allNumbers[allNumbers.Length - 1]; // last value (always the greatest)

            for (int i = 0; i < allNumbers.Length; i++)
            {
                int currentValue = allNumbers[i]; 

                if (allMarker[i] == false) 
                    continue;
                int jumpvalue = currentValue;

                for(int value = currentValue + jumpvalue; value <= maxValue; value += jumpvalue)
                {
                    
                    if (value > maxValue) 
                        break;
                    var index = Array.IndexOf(allNumbers, value);
                    if (index == -1) 
                        break; //not found
                    allMarker[index] = false;
                }

            }

            var result = allNumbers.Where((x,i)=>
            {
                if (allMarker[i] == true) 
                    return true;
                return false;
            }).ToArray();
           
            Console.WriteLine(string.Format("There are {0} prime numbers below {1}, they are {2}", result.Length, upperLimited, string.Join(",", result))); //optional
            return result;
        }

}