From 2d229759c3adc6f76d09a00f71e197967ff3b850 Mon Sep 17 00:00:00 2001
From: swamini-jadhav <swamini0805@gmail.com>
Date: Mon, 20 Oct 2025 16:09:40 +0530
Subject: [PATCH 1/3] Add Next_Prime_Number with prime checking logic

Implement function to find the next prime number.
---
 maths/Next_Prime_Number.py | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 maths/Next_Prime_Number.py

diff --git a/maths/Next_Prime_Number.py b/maths/Next_Prime_Number.py
new file mode 100644
index 000000000000..03c0fc201e82
--- /dev/null
+++ b/maths/Next_Prime_Number.py
@@ -0,0 +1,24 @@
+"""
+In the ancient city of Numeria, legends speak of an oracle whose whispers could bend the very fabric of mathematics. 
+Travelers from distant lands would bring her a number, and in return, she would reveal its future: the very next prime number.
+Your task is to embody the oracle's wisdom. You will be given a number.
+You must find the smallest prime number that is strictly greater than it.
+"""
+def check_prime(n):
+    if n<=1:
+        return False
+    if n<=3:
+        return True
+    if n%2==0 or n%3==0:
+        return False
+    temp=5
+    while temp*temp<=n:
+        if n%temp==0 or n%(temp+2)==0:
+            return False
+        temp+=6
+    return True
+n=int(input())
+next_prime=n+1
+while not check_prime(next_prime):
+  next_prime+=1
+print(next_prime)

From 443836e34f75738ead31222ad4bbf981b38404e0 Mon Sep 17 00:00:00 2001
From: swamini-jadhav <swamini0805@gmail.com>
Date: Mon, 20 Oct 2025 16:26:45 +0530
Subject: [PATCH 2/3] Rename Next_Prime_Number.py to next_prime_number.py

---
 maths/Next_Prime_Number.py | 24 ------------------------
 maths/next_prime_number.py | 30 ++++++++++++++++++++++++++++++
 2 files changed, 30 insertions(+), 24 deletions(-)
 delete mode 100644 maths/Next_Prime_Number.py
 create mode 100644 maths/next_prime_number.py

diff --git a/maths/Next_Prime_Number.py b/maths/Next_Prime_Number.py
deleted file mode 100644
index 03c0fc201e82..000000000000
--- a/maths/Next_Prime_Number.py
+++ /dev/null
@@ -1,24 +0,0 @@
-"""
-In the ancient city of Numeria, legends speak of an oracle whose whispers could bend the very fabric of mathematics. 
-Travelers from distant lands would bring her a number, and in return, she would reveal its future: the very next prime number.
-Your task is to embody the oracle's wisdom. You will be given a number.
-You must find the smallest prime number that is strictly greater than it.
-"""
-def check_prime(n):
-    if n<=1:
-        return False
-    if n<=3:
-        return True
-    if n%2==0 or n%3==0:
-        return False
-    temp=5
-    while temp*temp<=n:
-        if n%temp==0 or n%(temp+2)==0:
-            return False
-        temp+=6
-    return True
-n=int(input())
-next_prime=n+1
-while not check_prime(next_prime):
-  next_prime+=1
-print(next_prime)
diff --git a/maths/next_prime_number.py b/maths/next_prime_number.py
new file mode 100644
index 000000000000..1f7bb9546a34
--- /dev/null
+++ b/maths/next_prime_number.py
@@ -0,0 +1,30 @@
+"""
+In the ancient city of Numeria, 
+legends speak of an oracle whose whispers 
+could bend the very fabric of mathematics. 
+Travelers from distant lands would bring 
+her a number, and in return, she would reveal 
+its future: the very next prime number.
+Your task is to embody the oracle's wisdom. 
+You will be given a number.
+You must find the smallest prime number 
+that is strictly greater than it.
+"""
+def check_prime(n):
+    if n<=1:
+        return False
+    if n<=3:
+        return True
+    if n%2==0 or n%3==0:
+        return False
+    temp=5
+    while temp*temp<=n:
+        if n%temp==0 or n%(temp+2)==0:
+            return False
+        temp+=6
+    return True
+n=int(input())
+next_prime=n+1
+while not check_prime(next_prime):
+  next_prime+=1
+print(next_prime)

From fef9291959506ae60ee371223b588ce0092ca567 Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Mon, 20 Oct 2025 10:59:26 +0000
Subject: [PATCH 3/3] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 maths/next_prime_number.py | 38 +++++++++++++++++++++-----------------
 1 file changed, 21 insertions(+), 17 deletions(-)

diff --git a/maths/next_prime_number.py b/maths/next_prime_number.py
index 1f7bb9546a34..3055df010e25 100644
--- a/maths/next_prime_number.py
+++ b/maths/next_prime_number.py
@@ -1,30 +1,34 @@
 """
-In the ancient city of Numeria, 
-legends speak of an oracle whose whispers 
-could bend the very fabric of mathematics. 
-Travelers from distant lands would bring 
-her a number, and in return, she would reveal 
+In the ancient city of Numeria,
+legends speak of an oracle whose whispers
+could bend the very fabric of mathematics.
+Travelers from distant lands would bring
+her a number, and in return, she would reveal
 its future: the very next prime number.
-Your task is to embody the oracle's wisdom. 
+Your task is to embody the oracle's wisdom.
 You will be given a number.
-You must find the smallest prime number 
+You must find the smallest prime number
 that is strictly greater than it.
 """
+
+
 def check_prime(n):
-    if n<=1:
+    if n <= 1:
         return False
-    if n<=3:
+    if n <= 3:
         return True
-    if n%2==0 or n%3==0:
+    if n % 2 == 0 or n % 3 == 0:
         return False
-    temp=5
-    while temp*temp<=n:
-        if n%temp==0 or n%(temp+2)==0:
+    temp = 5
+    while temp * temp <= n:
+        if n % temp == 0 or n % (temp + 2) == 0:
             return False
-        temp+=6
+        temp += 6
     return True
-n=int(input())
-next_prime=n+1
+
+
+n = int(input())
+next_prime = n + 1
 while not check_prime(next_prime):
-  next_prime+=1
+    next_prime += 1
 print(next_prime)