Prime decomposition of Kaprekar numbers (up to 29 digits)

Finding Kaprekar Constants using a recursive Kaprekar's Routine algorithm (brute force).

Python package to perform Kaprekar's routine for 4 digit numbers

Example of implementation of the Kaprekar Algorithm.

A simple program to determine which four-digit integers reach Kaprekar's constant in a single step.

A Kaprekar number is one whose square can be divided into two parts, such that adding them together yields the original number. For example, the number 9 is a Kaprekar number, since 9^2 = 81, and 8 + 1 = 9.

Analyzing Kaprekar's Constant and Creating Data Visualization of Kaprekar Routines

Program to run Kaprekar's constant

Test if a natural number is a Kaprekar number