The programming language is lisp.

Not the first, nor the only one, but this function (with its factorial helper) gives one such Consecutive Composite Sequence: (defun factorial (n) (if (zerop n) 1 (* n (factorial (- n 1)))) (defun consecutive-composite-sequence-of-length (r) (let ((r+1-factorial (factorial (1+ r)))) (loop for n from 1 to r collect (+ r+1-factorial n 1)))) Write code (e.g., flesh out) to verify that the above defined sequence contains only composites. (defun all-composite (r)...) Note that in a sequence of consecutive numbers, every other one is even, hence composite, every third one is a multiple of 3, hence composite, etc. But is there a better way to see this tharn sifting through the sequence looking for primes somehow hiding among all those composites? Why or why not? Not the first, nor the only one, but this function (with its factorial helper) gives one such Consecutive Composite Sequence: (defun factorial (n) (if (zerop n) 1 (* n (factorial (- n 1)))) (defun consecutive-composite-sequence-of-length (r) (let ((r+1-factorial (factorial (1+ r)))) (loop for n from 1 to r collect (+ r+1-factorial n 1)))) Write code (e.g., flesh out) to verify that the above defined sequence contains only composites. (defun all-composite (r)...) Note that in a sequence of consecutive numbers, every other one is even, hence composite, every third one is a multiple of 3, hence composite, etc. But is there a better way to see this tharn sifting through the sequence looking for primes somehow hiding among all those composites? Why or why not