How to resolve the algorithm Munchausen numbers step by step in the APL programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Munchausen numbers step by step in the APL programming language
Table of Contents
Problem Statement
A Munchausen number is a natural number n the sum of whose digits (in base 10), each raised to the power of itself, equals n. (Munchausen is also spelled: Münchhausen.) For instance: 3435 = 33 + 44 + 33 + 55
Find all Munchausen numbers between 1 and 5000.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Munchausen numbers step by step in the APL programming language
Source code in the apl programming language
(⊢(/⍨)⊢=+/∘(*⍨∘⍎¨⍕)¨)⍳ 5000
You may also check:How to resolve the algorithm Jacobi symbol step by step in the Crystal programming language
You may also check:How to resolve the algorithm Generate lower case ASCII alphabet step by step in the Go programming language
You may also check:How to resolve the algorithm Unicode variable names step by step in the PowerShell programming language
You may also check:How to resolve the algorithm Metallic ratios step by step in the J programming language
You may also check:How to resolve the algorithm Menu step by step in the AutoHotkey programming language