Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Find the 24th, 101st and 251st prime number.
- using System;
- class PrimeNumbers
- {
- static void Main()
- {
- Console.WindowWidth = 80;
- int prime24 = 0;
- int prime101 = 0;
- int prime251 = 0;
- int counting = 1;
- bool isPrime = true;
- Console.Write("Enter a Number: ");
- int number = int.Parse(Console.ReadLine());
- Console.WriteLine("\n" + "Prime Numbers: " + "\n" + new string('-', 80));
- for (int i = 2; i <= number; i++)
- {
- for (int a = 2; a < i; a++)
- {
- if (i != a && i % a == 0)
- {
- isPrime = false;
- break;
- }
- }
- if (isPrime)
- {
- Console.Write("No" + counting++ + " is " + i + "\t");
- }
- isPrime = true;
- if (counting == 24)
- prime24 = i + 1;
- if (counting == 101)
- prime101 = i + 1;
- if (counting == 251)
- prime251 = i + 1;
- if (counting == 252)
- break;
- }
- Console.WriteLine("\n" + new string('-', 80));
- Console.WriteLine("No24 of Prime is " + prime24);
- Console.WriteLine("No101 of Prime is " + prime101);
- Console.WriteLine("No251 of Prime is " + prime251);
- Console.ReadLine();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement