28 lines
1,003 B
Text
28 lines
1,003 B
Text
;Definition:
|
|
A factorion is a natural number that equals the sum of the factorials of its digits.
|
|
|
|
|
|
;Example:
|
|
'''145''' is a factorion in base '''10''' because:
|
|
<b>
|
|
<big> 1! + 4! + 5! = 1 + 24 + 120 = 145 </big>
|
|
</b>
|
|
|
|
|
|
It can be shown (see talk page) that no factorion in base '''10''' can exceed '''1,499,999'''.
|
|
|
|
|
|
;Task:
|
|
Write a program in your language to demonstrate, by calculating and printing out the factorions, that:
|
|
:* There are '''3''' factorions in base '''9'''
|
|
:* There are '''4''' factorions in base '''10'''
|
|
:* There are '''5''' factorions in base '''11'''
|
|
:* There are '''2''' factorions in base '''12''' (up to the same upper bound as for base '''10''')
|
|
|
|
|
|
;See also:
|
|
:* '''[[wp:Factorion|Wikipedia article]]'''
|
|
:* '''[[OEIS:A014080|OEIS:A014080 - Factorions in base 10]]'''
|
|
:* '''[[OEIS:A193163|OEIS:A193163 - Factorions in base n]]'''
|
|
<br><br>
|
|
|