40
Given a number n >= 2, output all the positive integers less than n where gcd(n, k) == 1 (with k being any one of the output numbers). Numbers of this sort are coprime to each other.
Example: 10 gives the output [1, 3, 7, 9] (in any form you like, as long as the numbers are unambiguously separa...