We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b32abe3 commit fbfa6f3Copy full SHA for fbfa6f3
src/main/java/com/thealgorithms/maths/KrishnamurthyNumber.java
@@ -5,9 +5,7 @@
5
*
6
* A Krishnamurthy number (also known as a Strong number) is a number whose sum of the factorials of its digits is equal to the number itself.
7
8
- * For more information, refer to the
9
- * <a href="https://en.wikipedia.org/wiki/Strong_number">Krishnamurthy number</a> Wikipedia page.
10
- *
+ * For example, 145 is a Krishnamurthy number because 1! + 4! + 5! = 1 + 24 + 120 = 145.
11
* <b>Example usage:</b>
12
* <pre>
13
* boolean isKrishnamurthy = KrishnamurthyNumber.isKrishnamurthy(145);
0 commit comments