Two integers are coprimes if the their only greatest common divisor is 1.
## Task
In this kata you'll be given a number ```n >= 2``` and output a list with all positive integers less than ```gcd(n, k) == 1```, with ```k``` being any of the output numbers.
The list cannot include duplicated entries and has to be sorted.
## Examples
```
2 -> [1]
3 -> [1, 2]
6 -> [1, 5]
10 -> [1, 3, 7, 9]
20 -> [1, 3, 7, 9, 11, 13, 17, 19]
25 -> [1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 21, 22, 23, 24]
30 -> [1, 7, 11, 13, 17, 19, 23, 29]
```
from fractions import gcd as g
z=lambda x,y:1 if g(x,y)==1 else 0
def coprimes(n):return [i for i in range(1,n) if z(n,i)==1]

from fractions import gcd as g
z=lambda x,y:1 if g(x,y)==1 else 0
def coprimes(n):return [i for i in range(1,n) if z(n,i)==1]
