Post Closed as "duplicate" by Mr. Xcoder code-golf of
    Post Reopened by totallyhuman code-golf
10 duplicates list edited from Is this number a prime? to Sum of primes between given range, Is this number a prime?
| link
    Post Closed as "duplicate" by Sriotchilism O'Zaic code-golf of
9 added 56 characters in body
source | link

Bertrand's postulateBertrand's postulate states that there is always at least 1 prime number between n and 2n for all n greater than 1.

Challenge

Your task is to take a positive integer n greater than 1 and find all of the primes between n and 2n (exclusive).

Any default I/O method can be used. Whoever writes the shortest code (in bytes) wins!

Test cases

n    2n     primes

2    4      3
7    14     11, 13
13   26     17, 19, 23
18   36     19, 23, 29, 31
21   42     23, 29, 31, 37, 41

Bertrand's postulate states that there is always at least 1 prime number between n and 2n for all n greater than 1.

Challenge

Your task is to take a positive integer n greater than 1 and find all of the primes between n and 2n (exclusive).

Any default I/O method can be used. Whoever writes the shortest code (in bytes) wins!

Test cases

n    2n     primes

2    4      3
7    14     11, 13
13   26     17, 19, 23
18   36     19, 23, 29, 31
21   42     23, 29, 31, 37, 41

Bertrand's postulate states that there is always at least 1 prime number between n and 2n for all n greater than 1.

Challenge

Your task is to take a positive integer n greater than 1 and find all of the primes between n and 2n (exclusive).

Any default I/O method can be used. Whoever writes the shortest code (in bytes) wins!

Test cases

n    2n     primes

2    4      3
7    14     11, 13
13   26     17, 19, 23
18   36     19, 23, 29, 31
21   42     23, 29, 31, 37, 41
8 added 214 characters in body
source | link

By Bertrand's postulate, states that there is always aat least 1 prime number between nn and 2n2n for all n greater than 1.

Challenge

Your task is to take a positive integer n highergreater than 1 and find all of the primes between n and 2n (exclusive).

Any default I/O method can be used. Whoever writes the shortest code (in bytes) wins!

Test casecases

Input

7n    2n     primes

Output


2    4      3
7    14     11, 13
13   26     17, 19, 23
18   36     19, 23, 29, 31
21   42     23, 29, 31, 37, 41

By Bertrand's postulate, there is always a prime between n and 2n.

Challenge

Your task is to take a positive integer n higher than 1 and find all of the primes between n and 2n (exclusive).

Any default I/O method can be used. Whoever writes the shortest code (in bytes) wins!

Test case

Input

7

Output

11 13

Bertrand's postulate states that there is always at least 1 prime number between n and 2n for all n greater than 1.

Challenge

Your task is to take a positive integer n greater than 1 and find all of the primes between n and 2n (exclusive).

Any default I/O method can be used. Whoever writes the shortest code (in bytes) wins!

Test cases

n    2n     primes

2    4      3
7    14     11, 13
13   26     17, 19, 23
18   36     19, 23, 29, 31
21   42     23, 29, 31, 37, 41
7 edited tags
| link
6 added 101 characters in body
source | link
5 Changed title to better reflect what the challenge actually asks
| link
4 added 74 characters in body
source | link
3 deleted 5 characters in body
source | link
2 deleted 38 characters in body
source | link
1
source | link