mirror of
https://github.com/Xevion/exercism.git
synced 2025-12-06 03:15:01 -06:00
19 lines
828 B
Markdown
19 lines
828 B
Markdown
# Armstrong Numbers
|
|
|
|
An [Armstrong number](https://en.wikipedia.org/wiki/Narcissistic_number) is a number that is the sum of its own digits each raised to the power of the number of digits.
|
|
|
|
For example:
|
|
|
|
- 9 is an Armstrong number, because `9 = 9^1 = 9`
|
|
- 10 is *not* an Armstrong number, because `10 != 1^2 + 0^2 = 1`
|
|
- 153 is an Armstrong number, because: `153 = 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153`
|
|
- 154 is *not* an Armstrong number, because: `154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190`
|
|
|
|
Write some code to determine whether a number is an Armstrong number.
|
|
## Source
|
|
|
|
Wikipedia [https://en.wikipedia.org/wiki/Narcissistic_number](https://en.wikipedia.org/wiki/Narcissistic_number)
|
|
|
|
## Submitting Incomplete Solutions
|
|
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
|