From f79f631b69e33d0d9900b70e715910d96aa33281 Mon Sep 17 00:00:00 2001
From: Shashank767 <143302681+Shashank23123458867504@users.noreply.github.com>
Date: Thu, 9 Apr 2026 10:22:54 +0530
Subject: [PATCH 1/3] Refactor prime number check in prime.py

Fix input handling and improve prime number check logic.
---
 prime.py | 10 ++++++++--
 1 file changed, 8 insertions(+), 2 deletions(-)

diff --git a/prime.py b/prime.py
index 5e5864b..f3e28ab 100644
--- a/prime.py
+++ b/prime.py
@@ -1,2 +1,8 @@
-n = input
-i = 0
+n = int(input())
+for i in range(2, n//2 + 1):
+    if n%i==0:
+        print("Not a Prime Number")
+        break
+else:
+    print("It is a Prime Number")
+    

From be8df504c45265414b975202894472cfa57beb36 Mon Sep 17 00:00:00 2001
From: Shashank767 <143302681+Shashank23123458867504@users.noreply.github.com>
Date: Thu, 9 Apr 2026 10:36:24 +0530
Subject: [PATCH 2/3] Improve prime number check logic

Added a check for numbers less than or equal to 1.
---
 prime.py | 13 ++++++++-----
 1 file changed, 8 insertions(+), 5 deletions(-)

diff --git a/prime.py b/prime.py
index f3e28ab..d9c698f 100644
--- a/prime.py
+++ b/prime.py
@@ -1,8 +1,11 @@
 n = int(input())
-for i in range(2, n//2 + 1):
-    if n%i==0:
-        print("Not a Prime Number")
-        break
+if n<=1:
+    print("Not a Prime Number")
 else:
-    print("It is a Prime Number")
+    for i in range(2, n//2 + 1):
+        if n%i==0:
+            print("Not a Prime Number")
+            break
+    else:
+        print("It is a Prime Number")
     

From 509a8d4923e9154255d4de8c36f6986939aa924b Mon Sep 17 00:00:00 2001
From: Shashank767 <143302681+Shashank23123458867504@users.noreply.github.com>
Date: Thu, 9 Apr 2026 10:38:01 +0530
Subject: [PATCH 3/3] Improve prime number checking algorithm

Optimize prime number check to use square root method.
---
 prime.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/prime.py b/prime.py
index d9c698f..606d5ff 100644
--- a/prime.py
+++ b/prime.py
@@ -2,7 +2,7 @@
 if n<=1:
     print("Not a Prime Number")
 else:
-    for i in range(2, n//2 + 1):
+    for i in range(2, int(n ** 0.5) + 1):
         if n%i==0:
             print("Not a Prime Number")
             break