Prime numbers between n and 2n 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
Jelly, 4 bytes

‘æRḤ


Try it online!

waiting for OP's answer in comment...

(doesn't work for n=1)