Prime number
Detailed guide and Python implementation for the 'Prime number' problem.
Problem Statement
Write a function is_prime(n) that takes a positive integer n and returns True if n is a prime number, or False otherwise. A prime number is a number greater than 1 that has no divisors other than 1 and itself.
- •1 <= n <= 10^6
Examples
n = 7
True
7 is only divisible by 1 and 7, so it is prime.
n = 4
False
4 is divisible by 2 (4 = 2 × 2), so it is not prime.
n = 1
False
1 is not considered a prime number by definition.
Need a Hint?
Edge Cases to Watch
- Empty input structures
- Single element inputs
- Large numerical bounds
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.
Recommended Python Resources
Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.
Python Loops
Learn how to use Python loops to iterate over data. Master for loops, while loops, break, continue, and loop best practices with interactive examples.
How to Generate Random Numbers in Python
Learn how to generate random numbers in Python. Compare randrange, randint, and uniform float generation with seeding control.
Python String Methods
A complete reference guide for Python string manipulation. Master formatting, searching, splitting, replacing, and checking string properties.
Python vs JavaScript: Which Programming Language is Best?
A comprehensive comparison between Python and JavaScript. Explore syntax differences, performance, use cases (backend vs frontend), and coding examples.