PrimeNumbers

Question

(PrimeNumbers) An integer is said to be prime if it is divisible by only 1 and itself. For example 2 3 5 and 7 are prime but 4 6 8 and 9 are not. 1- Write a function that determines whether a number is prime if the number is prime return true otherwise return false. 2- Use this function in a program that determines and prints all the prime numbers between 2 and 10000

Vulpes · Answer

This is one I've written a few times on here: using System; using System.Collections.Generic; class Prime { static void Main() { Console.WriteLine(The prime numbers less than 10000 are :
); int count = 0; // print 12 per line say for (int i = 2; i { if(IsPrime(i)) { Console.Write({05}  i); count++; if (count == 12) { Console.WriteLine(); count = 0; } } } if (count > 0) Console.WriteLine(); Console.ReadKey(); } static bool IsPrime(int i) { if (i for(int j = 2; j { if (i % j == 0) return false; } return true; } }