Return the next prime after n accordingly division test.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer(kind=I4P), | intent(in) | :: | n | Number inquired. |
Next prime after n.
pure function find_next_prime(n) result(prime)
!---------------------------------------------------------------------------------------------------------------------------------
!< Return the next prime after `n` accordingly division test.
!---------------------------------------------------------------------------------------------------------------------------------
integer(I4P), intent (in) :: n !< Number inquired.
integer(I4P) :: prime !< Next prime after `n`.
!---------------------------------------------------------------------------------------------------------------------------------
!---------------------------------------------------------------------------------------------------------------------------------
prime = n + 1_I4P
do while(.not.is_prime(prime))
prime = prime + 1_I4P
enddo
!---------------------------------------------------------------------------------------------------------------------------------
endfunction find_next_prime