Post History
Given an integer n, output the smallest prime such that the difference between it and the next prime is at least n. For example, if n=5, you would output 23, since the next prime is 29, and 29-23&...
Question
code-golf
#4: Post edited
by
General Sebast1an
·
2021-08-12T19:02:43Z (over 3 years ago)
Prime Difference
- Given an integer *n*, output the smallest prime such that the difference between it and the next prime is at least *n*.
- For example, if `n=5`, you would output `23`, since the next prime is `29`, and `29-23>=5`.
- # More Input/Output Examples
- 1 -> 2 (3 - 2 >= 1)
- 2 -> 3 (5 - 3 >= 2)
- 3 -> 7 (11 - 7 >= 3)
- 4 -> 7
- 5 -> 23
- 6 -> 23
- 7 -> 89
- 8 -> 89
This is code-golf, so shortest code wins.
- Given an integer *n*, output the smallest prime such that the difference between it and the next prime is at least *n*.
- For example, if `n=5`, you would output `23`, since the next prime is `29`, and `29-23>=5`.
- # More Input/Output Examples
- 1 -> 2 (3 - 2 >= 1)
- 2 -> 3 (5 - 3 >= 2)
- 3 -> 7 (11 - 7 >= 3)
- 4 -> 7
- 5 -> 23
- 6 -> 23
- 7 -> 89
- 8 -> 89
- This is <a class="badge is-tag">code-golf</a>, so shortest code wins.
#3: Question reopened
by
Quintec
·
2020-12-10T21:03:41Z (about 4 years ago)
#2: Question closed
by
Quintec
·
2020-12-10T21:03:35Z (about 4 years ago)
#1: Initial revision
by
Quintec
·
2020-11-14T17:16:19Z (about 4 years ago)
Prime Difference
Given an integer *n*, output the smallest prime such that the difference between it and the next prime is at least *n*.
For example, if `n=5`, you would output `23`, since the next prime is `29`, and `29-23>=5`.
# More Input/Output Examples
1 -> 2 (3 - 2 >= 1)
2 -> 3 (5 - 3 >= 2)
3 -> 7 (11 - 7 >= 3)
4 -> 7
5 -> 23
6 -> 23
7 -> 89
8 -> 89
This is code-golf, so shortest code wins.