# Next Prime Number π’
This Python script finds and returns the next prime number each time the user requests one.
## π§ How it works
- The program starts at 2, the first prime number.
- It checks each subsequent number to see if it is prime.
- When a prime number is found, it is printed.
- The user is asked whether they want the next prime.
- The process repeats until the user answers "no".
## π¬ Example interaction
Next prime is: 2
Do you want to continue? yes
Next prime is: 3
Do you want to continue? yes
Next prime is: 5
Do you want to continue? no
## π Technologies used
- Python 3
- Loops and conditionals
- Modulo operator for checking divisibility
- User interaction with input()
## π Files included
- next\_prime.ipynb
β Jupyter Notebook with the working solution
- README.md
β this file
Created with π‘ by Olga