Advertisement
brospresident

Untitled

Oct 11th, 2021
921
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.74 KB | None | 0 0
  1. public class numerePrime {
  2.     public static void main(String[] args) {
  3.         PrimeChecker check = new PrimeChecker();
  4.  
  5.         for (int i = 0; i < 20; ++i) {
  6.             if (check.isPrime(i) == true) {
  7.                 System.out.println(i + " este prim");
  8.             }
  9.             else {
  10.                 System.out.println(i + " nu este prim");
  11.             }
  12.         }
  13.     }
  14. }
  15.  
  16. class PrimeChecker {
  17.     public boolean isPrime(int number) {
  18.         if (number == 0 || number == 1) return false;
  19.         if (number % 2 == 0 || number % 3 == 0) return false;
  20.  
  21.         for (int i = 5; i <= Math.sqrt(number); i += 6) {
  22.             if (number % i == 0 || number % (i + 2) == 0) return false;
  23.         }
  24.         return true;
  25.     }
  26. }
  27.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement