Oh! If only I'd actually written the math down on a piece of paper.
That is so elegant :)

Very true. Luckily we have a multitude of tools in the toolbox with which to solve real-world problems. If we had to do it all in assembler life would be tedious indeed. In the same way that I don't use a hammer-drill to put a picture nail in a wall, I don't use assembler to build web APIs.

I disagree. The art of programming is to deliver the right solution in a clear and concise manner. Sure, we could written this in any number of ways, a for loop, a recursive algorithm, but it is more important to make your code readable than it is to make it work.
If using system libraries delivers a clearly understandable codebase that executes within required parameters, then use them. If they don't, dont.

Wouldn't want to run this simple categorisation against a database of millions! Object instantiation for each comparison of 2 intgers?

Question is confusing. It says to create a count for each number 1-1000 that can be divided by the numbers 1-25, not say how many times 1000 can be divided by the numbers 1-25, which is what provides the final answer!

The link gives the answer. Not sure that makes this kata particularly useful or challenging!

Clojure version still broken

java.io.FileNotFoundException: Could not locate kata/lowercase_count__init.class or kata/lowercase_count.clj on classpath. Please check that namespaces with dashes use underscores in the Clojure file name., compiling:(null:1:1)

I was following this until I got to polomljeniDeo :-)

Nice to see a recursive GCD!

Simple. Elegant. Obvious.