Prime decomposition of Kaprekar numbers (up to 29 digits)
-
Updated
Dec 23, 2025
Prime decomposition of Kaprekar numbers (up to 29 digits)
Python package to perform Kaprekar's routine for 4 digit numbers
Concepts of mathematics programmed in Ruby.
Interactive proof engine for Kaprekar's constant (6174) — reduces 10,000 four-digit numbers to 54 equivalence classes via digit-gap analysis, then verifies universal convergence through directed graph topology.
Analyzing Kaprekar's Constant and Creating Data Visualization of Kaprekar Routines
simple jQuery app just to have some fun with numbers :)
Kaprekar carpets notebook
Program to run Kaprekar's constant
Example of implementation of the Kaprekar Algorithm.
A simple program to determine which four-digit integers reach Kaprekar's constant in a single step.
Python visualization of the Kaprekar process for arbitrary-digit numbers. Analyzes and plots convergence to Kaprekar constants and holes.
An interactive tribute to the beauty of number theory and the work of D.R. Kaprekar.
Implementação em PYTHON do Algoritmo de Kaprekar. O programa demonstra como qualquer número de 4 dígitos, ao seguir a rotina de ordenação e subtração, converge para a constante 6174, baseando-se no trabalho de D. R. Kaprekar
Calculating and visualizing Kaprekar constant (6174) using R
A simple Python implementation of the Kaprekar routine that demonstrates how 4-digit numbers converge to the constant 6174 through iterative digit rearrangement and subtraction.
Python bruteforce script for the kaprekar constant
Add a description, image, and links to the kaprekar topic page so that developers can more easily learn about it.
To associate your repository with the kaprekar topic, visit your repo's landing page and select "manage topics."