Problem 57795. Armstrong Number

Created by Md. Ikrama Hossain
Appears in Combinatorics I

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Write a function name armstrong_check that checks whether the given input is an Armstrong Number or not. It returns logical True or False.
An Armstrong number is one whose sum of digits raised to the power of the number of digits equals the number itself. For example, 371 is an Armstrong number because 3^3 + 7^3 + 1^3 = 371.

Solve

Solution Stats

57 Solutions
20 Solvers

Last Solution submitted on Apr 25, 2024

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

Ramon Villamangca on 17 Mar 2023

Hi Md,

The definition of Armstrong number is incorrect. Armstrong numbers are equal to sum of their own digits to the power of the number of digits (not power of three).

ChrisR on 17 Mar 2023

This problem is a more general version of Cody Problem 1407.

goc3 on 19 Apr 2023

The problem description has been edited slightly to correctly refer to the power number.

Solution Comments

Show comments

FEATURED DISCUSSION

Primes and Rough Numbers, Basic ideas

What is a rough number? What can they be used...

John D'Errico in Tips & Tricks

View Post

Problem Recent Solvers20

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 57795. Armstrong Number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Primes and Rough Numbers, Basic ideas

Problem Recent Solvers20

Suggested Problems

More from this Author8

Problem Tags

Community Treasure Hunt

Problem 57795. Armstrong Number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Primes and Rough Numbers, Basic ideas

Problem Recent Solvers20

Suggested Problems

More from this Author8

Problem Tags

Community Treasure Hunt

Players