Let’s find all the prime numbers between one and a thousand. We’ll use a variant of TDD to do this. The cycle will be the same size as normal TDD. We can find out by using the map function. The rem-explanatory function should be the remainder of the integer n.
Sort: