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]
```

Difficulty: introductory

Starter code:

def coprimes(n):
	

Solutions:
from fractions import gcd

def coprimes(n):
  return [i for i in range(1,n+1) if gcd(n,i)==1]

from fractions import gcd
def coprimes(n):
    return [i for i in range(n) if gcd(i,n)==1]

from fractions import gcd

coprimes = lambda n: [i for i in range(1, n) if gcd(n, i) == 1]

from fractions import gcd 
def coprimes(n): return [a for a in range(1, n) if gcd(n,a) == 1]

def coprimes(n):
    p, s = n, list(range(n))
    for d in range(2, int(n ** .5) + 1):
        if not p % d:
            while not p % d: p //= d
            s[d::d] = ((n - d - 1) // d + 1) * [0]
    if p > 1: s[p::p] = ((n - p - 1) // p + 1) * [0]
    return [i for i, n in enumerate(s) if n]

from math import gcd

def coprimes(n):
    return [x for x in range(1, n) if gcd(x, n) == 1]

def gcd(a,b):
    while b > 0:
        a %= b
        a,b = b,a
    return a

def coprimes(n):
    return [x for x in range(1,n) if gcd(n,x) == 1]

def gcd(a, b):
    return a if b == 0 else gcd(b, a%b)

def coprimes(n):
    rslt = {1}
    for i in range(2, n):
        if gcd(n, i) == 1:
            rslt.add(i)
    return sorted(rslt)

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

def coprimes(n):
  ret = []
  for x in range(int(n/2)+1):
    if gcd(x,n-x) == 1:
      ret += [x]
      ret += [n-x]
  return sorted(set(ret))