Add Kaprekar number checker to special_numbers #12723
Conversation
10 is Disallowed, see above. |
Thanks for the link. Then, the definition should be clarified in the code function description to be: "Kaprekar numbers: positive numbers n such that n = q+r and n^2 = q*10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n != 10^a, a >= 1." (https://oeis.org/A006886)? |
for more information, see https://pre-commit.ci
Updated the function to align with the strict definition of Kaprekar numbers per OEIS A006886 and Iannucci (1997). Powers of 10 are now explicitly excluded. Let me know if there's anything else to improve! |
| square = str(n**2) | ||
| for i in range(1, len(square)): | ||
| left, right = square[:i], square[i:] | ||
| if int(right) == 0: |
There was a problem hiding this comment.
It seems this check is not needed anymore.
This PR adds a new function
is_kaprekar_number(n)undermaths/special_numbers/.The function determines whether a number is a Kaprekar number based on digit-splitting logic, where the square of a number is divided into two parts that sum to the original number. It includes inline doctests to demonstrate usage and ensure correctness.
✔️ This contribution follows all repository contribution guidelines:
n: int -> bool)doctest.testmod()🎯 Educational Value:
This function enhances the repository's coverage of special number classifications and provides a clean, beginner-friendly example of digit-based number theory in Python.
Tested and ready for review. Thank you for maintaining this valuable resource!