Given an integer N. The task is to find the next prime number i.e. the smallest prime number greater than N.
Input: N = 10
11 is the smallest prime number greater than 10.
Input: N = 0
- First of all, take a boolean variable found and initialise it to false.
- Now, until that variable not equals to true, increment N by 1 in each iteration and check whether it is prime or not.
- If it is prime then print it and change value of found variable to True. otherwise, iterate the loop untill you will get the next prime number.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Quick ways to check for Prime and find next Prime in Java
- Find next palindrome prime
- Find coordinates of a prime number in a Prime Spiral
- Next smallest prime palindrome
- Find Next number having distinct digits from the given number N
- Print the nearest prime number formed by adding prime numbers to N
- Check if a prime number can be expressed as sum of two Prime Numbers
- Count occurrences of a prime number in the prime factorization of every element from the given range
- Check if a number is Prime, Semi-Prime or Composite for very large numbers
- Given a number, find the next smallest palindrome
- Find next greater number with same set of digits
- Find Next Sparse Number
- Find the Next perfect square greater than a given number
- Find the next fibonacci number
- Find the next Non-Fibonacci number
- Program to find the Nth Prime Number
- Prime numbers after prime P with sum S
- Sum of each element raised to (prime-1) % prime
- Absolute Difference between the Sum of Non-Prime numbers and Prime numbers of an Array
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.