Advertisement
Gesh4o

PrimeNumbers

Sep 16th, 2015
102
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.95 KB | None | 0 0
  1. using System;
  2.  
  3. class PrimeNumberCheck
  4. {
  5. static void Main()
  6. {
  7. int n;
  8. int maxDevider;
  9. int minDevider = 2;
  10. Console.Write("Please insert an integer: ");
  11. n = int.Parse(Console.ReadLine());
  12. if (n <= 0 || n >= 100)
  13. {
  14. Console.WriteLine("Invalid input - the number must be below 100 and positive (e.g. 0<n<100)!");
  15. return;
  16. }
  17. maxDevider = (int)Math.Sqrt(n);
  18. bool prime = true;
  19. if(n==1)
  20. {
  21. Console.WriteLine("Your integer is prime - False !");
  22. return;
  23. }
  24. while (minDevider <= maxDevider)
  25. {
  26. if (n % minDevider == 0)
  27. {
  28. prime = false;
  29. }
  30. else
  31. {
  32. prime = true;
  33. }
  34. minDevider++;
  35. }
  36. Console.WriteLine("Your integer is prime - {0} !", prime);
  37. }
  38. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement