You are given a positive integer n. Your task is to return the smallest prime number strictly greater than n.
A prime number is an integer greater than 1 that has exactly two distinct positive divisors: 1 and itself. The returned prime must be greater than n, not equal to it.
Input: n = 10
Output: 11
Explanation: The smallest prime number strictly greater than 10 is 11.
Input: n = 13
Output: 17
Explanation: The numbers 14, 15, and 16 are not prime, so the next prime after 13 is 17.
Input: n = 1
Output: 2
Explanation: The smallest prime number greater than 1 is 2.
Sign in to write, run, and submit your solution against the full test suite.
