Problem Statement

A positive integer is a Kaprekar number if: Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.

10000 (1002) splitting from left to right:

Generate and show all Kaprekar numbers less than 10,000.

Optionally, count (and report the count of) how many Kaprekar numbers are less than 1,000,000.

The concept of Kaprekar numbers is not limited to base 10 (i.e. decimal numbers); if you can, show that Kaprekar numbers exist in other bases too.

For this purpose, do the following:

Let's start with the solution:

procedure is_kaprekar(n)  #: return n if n is a kaprekar number
if ( n = 1 ) |
   ( n^2 ? ( n = move(1 to *&subject-1) + (0 ~= tab(0)) | fail )) then
   return n 
end

procedure main()
every write(is_kaprekar(1 to 10000))                        # primary goal
every (count := 0, is_kaprekar(1 to 999999), count +:= 1)   # stretch goal
write ("Number of Kaprekar numbers less than 1000000 is ", count)
end