2.2.3. Sequences as Conventional Interfaces
Exercise 2.40

Unique pairs

Define a procedure unique-pairs that, given an integer n, generates the sequence of pairs (i,j) with 1 ≤ j < i ≤ n. Use unique-pairs to simplify the definition of prime-sum-pairs given above.



There are no comments yet.

Authentication required

You must log in to post a comment.

Login