Authors: Florentin Smarandache
We extend Kaprekar's Routine for a large class of applications. We also give particular examples of this generalization as alternatives to Kaprekar's Routine and Number. Some open questions about the length of the iterations until reaching either zero or a constant or a cycle, and about the length of the cycles are asked at the end.
Comments: 5 pages
[v1] 20 Mar 2010
Unique-IP document downloads: 34 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.