Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal
c l@(m:n:_)=m:c([x|x<-[1..],gcd m x<2,gcd n (m*n)x<2,all(/=x)l]!!0:l) ((0:1:c[2,1])!!) Usage example: ((0:1:c[2,1])!!) 12-> 17.
Build the list of all a(n), starting with 0 to fix the 1-based index and 1 and followed by c[2,1]. c takes the head of it's argument list l followed by a recursive call with then next number that fits (co-prime, not seen before) added in front of l. Pick the nth element of this list.
c l@(m:n:_)=m:c([x|x<-[1..],gcd m x<2,gcd n x<2,all(/=x)l]!!0:l) ((0:1:c[2,1])!!) Usage example: ((0:1:c[2,1])!!) 12-> 17.
Build the list of all a(n), starting with 0 to fix the 1-based index and 1 and followed by c[2,1]. c takes the head of it's argument list l followed by a recursive call with then next number that fits (co-prime, not seen before) added in front of l. Pick the nth element of this list.
c l@(m:n:_)=m:c([x|x<-[1..],gcd(m*n)x<2,all(/=x)l]!!0:l) ((0:1:c[2,1])!!) Usage example: ((0:1:c[2,1])!!) 12-> 17.
Build the list of all a(n), starting with 0 to fix the 1-based index and 1 and followed by c[2,1]. c takes the head of it's argument list l followed by a recursive call with then next number that fits (co-prime, not seen before) added in front of l. Pick the nth element of this list.
c l@(m:n:_)=m:c([x|x<-[1..],gcd m x<2,gcd n x<2,all(/=x)l]!!0:l) ((0:1:c[2,1])!!) Usage example: ((0:1:c[2,1])!!) 12-> 17.
Build the list of all a(n), starting with 0 to fix the 1-based index and 1 and followed by c[2,1]. c takes the head of it's argument list l followed by a recursive call with then next number that fits (co-prime, not seen before) added in front of l. Pick the nth element of this list.