I'm reading Brian Marick's Functional Programming for the Object-Oriented Programmer book.This is my solution for an exercise from the first chapter, Just Enough Clojure in which I had to write a "bizarre version of factorial that uses neither iteration nor recursion": Tested at the REPL it seems to work fine: However, there are problems for big enough results because they don't fit into integers: This can be easily solved using arbitrary precision integers. You just need to append an N after an...