From bb9309004558488ab1bb0f15b2c9f9a6d075ec4d Mon Sep 17 00:00:00 2001
From: Swati0030 <91402023+Swati0030@users.noreply.github.com>
Date: Mon, 31 Oct 2022 18:53:41 +0530
Subject: [PATCH] Create Prime Numbers

---
 Prime Numbers | 44 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 Prime Numbers

diff --git a/Prime Numbers b/Prime Numbers
new file mode 100644
index 0000000..32f4b55
--- /dev/null
+++ b/Prime Numbers	
@@ -0,0 +1,44 @@
+// A school method based Java program to
+// check if a number is prime
+import java.lang.*;
+import java.util.*;
+
+class GFG {
+
+	// Check for number prime or not
+	static boolean isPrime(int n)
+	{
+
+		// Check if number is less than
+		// equal to 1
+		if (n <= 1)
+			return false;
+
+		// Check if number is 2
+		else if (n == 2)
+			return true;
+
+		// Check if n is a multiple of 2
+		else if (n % 2 == 0)
+			return false;
+
+		// If not, then just check the odds
+		for (int i = 3; i <= Math.sqrt(n); i += 2) {
+			if (n % i == 0)
+				return false;
+		}
+		return true;
+	}
+
+	// Driver code
+	public static void main(String[] args)
+	{
+		if (isPrime(19))
+			System.out.println("true");
+
+		else
+			System.out.println("false");
+	}
+}
+
+// This code is contributed by Ronak Bhensdadia