Finding Kaprekar Constants using a recursive Kaprekar's Routine algorithm (brute force).
-
Updated
Apr 18, 2024 - Rust
Finding Kaprekar Constants using a recursive Kaprekar's Routine algorithm (brute force).
Prime decomposition of Kaprekar numbers (up to 29 digits)
Analyzing Kaprekar's Constant and Creating Data Visualization of Kaprekar Routines
Program to run Kaprekar's constant
Example of implementation of the Kaprekar Algorithm.
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.
Python package to perform Kaprekar's routine for 4 digit numbers
A simple program to determine which four-digit integers reach Kaprekar's constant in a single step.
Add a description, image, and links to the kaprekar-number topic page so that developers can more easily learn about it.
To associate your repository with the kaprekar-number topic, visit your repo's landing page and select "manage topics."