Armstrong Number in Java
Channel:
Subscribers:
1,540
Published on ● Video Link: https://www.youtube.com/watch?v=oCtMwm0oSS4
2Armstrong Number in Java
In this tutorial, I have shown how to write a program to check if a given number is an Armstrong Number or not.
A number is said to be Armstrong if sum of its digits raised to the power of length of the number is equal to the number.
Examples: 371, 1634, 54748.
#armstrongnumber #armstrong #java #computerscience #isc
Other Videos By Robin Sir
| 2023-09-10 | Fascinating Number in Java |
| 2023-07-21 | Circular Prime in Java |
| 2023-07-12 | Unit Matrix in Java |
| 2023-07-09 | Fill Matrix Column-wise in Java |
| 2023-07-07 | Smith Number in Java |
| 2023-07-05 | Record Class Inheritance in Java | ISC 2019 |
| 2023-07-04 | Toggle Case in Java |
| 2023-07-02 | Fibonacci String in Java |
| 2023-07-02 | Anagram Program in Java |
| 2023-06-30 | Binary Search in Java using Recursion |
| 2023-06-29 | Armstrong Number in Java |
| 2023-06-28 | Evil Number in Java |
| 2023-06-27 | Special Number in Java |
| 2023-06-26 | Prime Factorization in Java |
| 2023-06-25 | Happy Number in Java |
| 2023-06-24 | Matrix Transpose in Java |
| 2023-06-23 | Kaprekar Number in Java |
| 2023-06-22 | Palindrome Words in Java |
| 2023-06-21 | Fibonacci Term using Recursion |
| 2023-06-20 | GCD in Java using Recursion |
| 2023-06-19 | Factorial in Java using Recursion |
Tags:
robin sir
armstrong number example
armstrong number
recursion
java
isc
computer science