{"id":103333,"date":"2025-01-14T18:49:42","date_gmt":"2025-01-14T13:19:42","guid":{"rendered":"https:\/\/www.mygreatlearning.com\/blog\/prime-number-program-in-java\/"},"modified":"2025-01-14T18:51:34","modified_gmt":"2025-01-14T13:21:34","slug":"prime-number-program-in-java","status":"publish","type":"post","link":"https:\/\/www.mygreatlearning.com\/blog\/prime-number-program-in-java\/","title":{"rendered":"Prime Number Program in Java"},"content":{"rendered":"\n

Have you ever been fascinated by the mysterious world of numbers? Prime numbers are significant in computer technology and mathematics. Any natural integer larger than one that can only be divided by one and itself is called a prime number. Prime numbers are essential for resolving challenging computing issues in algorithm optimization and cryptography.<\/p>\n\n\n\n

In this blog, we will delve deeply into the idea of prime numbers and discover how to create several Java prime number applications. This blog will guide you on recognizing and operating with prime numbers, regardless of your level of experience as a developer. By the end, you will thoroughly understand various algorithms and how they are used in practical situations.<\/p>\n\n\n\n

What are prime numbers?<\/h2>\n\n\n\n

Let's first define prime numbers before moving on to the programming portion:<\/p>\n\n\n\n

Prime Numbers:<\/strong> Any integer more significant than one that cannot be formed by multiplying two smaller natural numbers is referred to as a prime number. <\/p>\n\n\n

\nExample: 2,3,5,7,9,11,13 etc.\n<\/pre><\/div>\n\n\n
Non-Prime Numbers:<\/strong> these are also called composite numbers since they can be divided by themselves and numbers other than 1. <\/p>\n\n\n
\nExample: 4,6,8,9,10 etc.\n<\/pre><\/div>\n\n\n
Characteristics of Prime Numbers:<\/strong><\/p>\n\n\n\n
    \n
  1. The only even prime number and also the smallest prime number is 2.<\/li>\n\n\n\n
  2. Every prime number larger than two is odd.<\/li>\n\n\n\n
  3. There are precisely two distinct positive divisors of a prime number.<\/li>\n\n\n\n
  4. Prime numbers are limitless, but they become less frequent as they get bigger.<\/li>\n<\/ol>\n\n\n\n
    Interesting fact: <\/strong>The most significant known prime number, as of 2023, is a Mersenne prime<\/a><\/strong> with over 24 million digits. <\/em>Mersenne primes<\/em><\/strong> take the form 2^p - 1, where p is also a prime number. These numbers are used in advanced computing and cryptography.<\/em><\/p>\n\n\n\n
    Algorithm to Check for a Prime Number<\/h2>\n\n\n\n
    To determine if a number is prime:<\/p>\n\n\n\n
      \n
    1. A number less than 2 is not prime.<\/li>\n\n\n\n
    2. Check the divisibility of the number from 2 up to the square root of the number.<\/li>\n\n\n\n
    3. If the number is divisible by any number in this range, it is not a prime number.<\/li>\n\n\n\n
    4. For large numbers, optimizations like skipping even numbers can save computation time.<\/li>\n<\/ol>\n\n\n\n
      Pseudocode<\/h3>\n\n\n
      \nFunction isPrime(n):\nIf n <= 1:\nReturn False\nFor i from 2 to \u221a(n):\nIf n % i == 0:\nReturn False\nReturn True\n<\/pre><\/div>\n\n\n
      This approach ensures efficiency, especially for large numbers, as we only check divisors up to the square root of the number.<\/p>\n\n\n\n
      The isPrime<\/code> method in this example is declared as public<\/code>, allowing it to be accessed from other classes. To learn more about how access modifiers work in Java, check out our guide on Access Modifiers in Java<\/a>.<\/p>\n\n\n\n
      Writing a Simple Prime Number Program in Java<\/h2>\n\n\n\n
      An introductory program to check if a number is prime:<\/p>\n\n\n
      \nimport java.util.Scanner;\npublic class PrimeNumberChecker {\npublic static void main(String[] args) {\nScanner scanner = new Scanner(System.in);\nSystem.out.print("Enter a number: ");\nint number = scanner.nextInt();\nif (isPrime(number)) {\nSystem.out.println(number + " is a prime number.");\n} else {\nSystem.out.println(number + " is not a prime number.");\n}\n}\npublic static boolean isPrime(int n) {\nif (n <= 1) return false;\nfor (int i = 2; i <= Math.sqrt(n); i++) {\nif (n % i == 0) return false;\n}\nreturn true;\n}\n}\n<\/pre><\/div>\n\n\n
      Explanation:<\/strong><\/h3>\n\n\n\n
      Input:<\/strong> The user enters a number.<\/p>\n\n\n\n
      Logic:<\/strong> The isPrime method checks divisibility up to the square root of the number.<\/p>\n\n\n\n
      Output:<\/strong> The program prints whether the number is prime or not.<\/p>\n\n\n
      \nSample Input and Output:\nInput: 7\nOutput: "7 is a prime number."\nInput: 10\nOutput: "10 is not a prime number."\n<\/pre><\/div>\n\n\n
      Are you not aware of data types in Java? This blog will help you learn Java data types<\/a>!<\/p>\n\n\n\n
      Optimizing the Prime Number Algorithm<\/h2>\n\n\n\n
      The above program works well, but it can be optimized further:<\/p>\n\n\n\n
      Key Optimizations<\/h3>\n\n\n\n
        \n
      1. Skip even numbers after checking 2, as all other even numbers are not prime.<\/li>\n\n\n\n
      2. Start the loop from 3 and increment by 2 to reduce iterations.<\/li>\n\n\n\n
      3. Advanced algorithms like the Sieve of Eratosthenes or probabilistic methods can be used for huge numbers.<\/li>\n<\/ol>\n\n\n\n
        Optimized Code<\/h3>\n\n\n
        \npublic static boolean isPrime(int n) {\nif (n <= 1) return false;\nif (n == 2) return true;\nif (n % 2 == 0) return false;\nfor (int i = 3; i <= Math.sqrt(n); i += 2) {\nif (n % i == 0) return false;\n}\nreturn true;\n}\n<\/pre><\/div>\n\n\n
        This approach reduces the number of iterations in half for large numbers, making it faster than before.<\/p>\n\n\n\n
        Advanced Prime Number Programs<\/h2>\n\n\n\n
        Here is a program to print all prime numbers in a range:<\/p>\n\n\n
        \npublic class PrimeNumbersInRange {\npublic static void main(String[] args) {\nint start = 10, end = 50;\nSystem.out.println("Prime numbers between " + start + " and " + end + ":");\nfor (int i = start; i <= end; i++) {\nif (isPrime(i)) {\nSystem.out.print(i + " ");\n}\n}\n}\npublic static boolean isPrime(int n) {\nif (n <= 1) return false;\nfor (int i = 2; i <= Math.sqrt(n); i++) {\nif (n % i == 0) return false;\n}\nreturn true;\n}\n}\n<\/pre><\/div>\n\n\n
        Output:<\/strong><\/p>\n\n\n
        \"Prime<\/figure>\n\n\n
        \nPrime numbers between 10 and 50: 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47\n<\/pre><\/div>\n\n\n
        Using Java's collection framework, such as ArrayList<\/code>, can simplify storing and manipulating prime numbers. Learn more about Collections in Java<\/a>.<\/p>\n\n\n\n
        Program to Generate the First 'N' Prime Numbers:<\/h2>\n\n\n
        \npublic class FirstNPrimes {\npublic static void main(String[] args) {\nint n = 10;\nint count = 0, num = 2;\nSystem.out.println("First " + n + " prime numbers:");\nwhile (count < n) {\nif (isPrime(num)) {\nSystem.out.print(num + " ");\ncount++;\n}\nnum++;\n}\n}\npublic static boolean isPrime(int n) {\nif (n <= 1) return false;\nfor (int i = 2; i <= Math.sqrt(n); i++) {\nif (n % i == 0) return false;\n}\nreturn true;\n}\n}\n<\/pre><\/div>\n\n\n
        Output:<\/strong><\/p>\n\n\n\n
        For the given input (n = 10), the output will be:<\/p>\n\n\n
        \nFirst 10 prime numbers:\n2 3 5 7 11 13 17 19 23 29\n<\/pre><\/div>\n\n\n
        Real-World Applications of Prime Numbers in Programming<\/h2>\n\n\n\n