Write a java program to check a number is armstrong or not using function .

Question

1.33/5 (3 votes)

See more:

Enter a anumber
55
55 Number is not an ArmStrong.

What I have tried:

Java

package com.streamapi;

import java.util.Scanner;

public class ArmStrongNumber {


	public static void main(String[] args) 
	{
		Scanner scanner=new Scanner(System.in);
		
		System.out.println("Enter a anumber");
		int number = scanner.nextInt();
		
		boolean ArmStrong = ArmStrong(number);

		if(ArmStrong)
		{
			System.out.println(number +" Number is an ArmStrong.");
		}
		else
		{
			System.out.println(number +" Number is not an ArmStrong.");
		}
	}

	private static boolean ArmStrong(int number) {
		
		return false;
	}
}

Posted 10-Mar-24 2:34am

simran sinha

Updated 10-Mar-24 5:30am

PIEBALDconsult

v2

Add a Solution

Comments

Richard MacCutchan 10-Mar-24 8:55am

What is the question?

Patrice T 10-Mar-24 9:11am

And you have a problem or a question ?

PIEBALDconsult 10-Mar-24 11:29am

We won't do your homework for you.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Pete O'Hanlon · Accepted Answer · 2024-03-10T04:20:00

You're almost there. All you have to do now is fill in the calculation part. That's a simple problem that shouldn't take you long. To help, I will remind you what the calculation is.

An Armstrong number is a number which is equal to the sum of each value raised to the power of the total number of digits. So, your calculation is going to take a string, and iterate over each character, converting it to a number, raising to the power of the string length. Add the value to the running total. If you reach the end of the loop and the total matches the input, congratulations, you found an Armstrong number.

There are some optimisations you can do. If the input isn't a number, reject it. If, during the loop, your running total exceeds the input value, it's definitely not an Armstrong number.