Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create changeprime.py #30

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions changeprime.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
# Function to check if a number is prime
def is_prime(n):
"""Returns True if the number is prime, otherwise False."""
if n <= 1:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True

# Example usage
if __name__ == "__main__":
test_number = 29
print(f"Is {test_number} a prime number? {is_prime(test_number)}")
As part of Hacktoberfest 2024, I’ve added a simple is_prime function in Python that checks if a number is prime. Here’s a quick overview of the contribution:

is_prime(n): A function that determines if a number is prime by checking divisibility.
Example usage to test functionality with a sample number.
Please consider accepting my pull request for Hacktoberfest 2024. I look forward to contributing and hope this function adds value to the project!

Thank you! 😊