This presentation introduces Armstrong numbers through definitions, examples, and a program to check if a number is Armstrong. It lists the project members, defines Armstrong numbers as numbers where the sum of each digit raised to the third power is equal to the number, and notes there are 13 Armstrong numbers between 1-999. It then shows the code in pseudocode to check if a given number is Armstrong and provides sample outputs.

1. Welcome
To Our Presentation

2. Project Members
Name
 Md.Sujan Mahmud
 Md Minjur Rahman
Id
 162-35-155
 162-35-153

3. Definition
 What is an armstrong number ?
 Example : 3^3+7^3+1^3 = 371
 Is “0” is an armstrong number? 000.
 Example : o^3+0^3+0^3=0
 Is armstrong number used in real life?

4.  How many armstrong number betweeen 1 to 999?
 1-9, 153, 370, 371, 407 total 13
 How do we write a programme to check for an
armstrong number?

5.  CLS
 INPUT "ENTER TESTING NUMBER="; N
 M = N
 WHILE N <> 0
 R = V MOD 10
 SUM = SUM + R ^ 3
 N = N/10
 WEND
 IF M = SUM THEN
 PRINT " IT IS AN ARMSTRONG NUMBER"
 ELSE
 PRINT "IT IS NOT AN ARMSTRONG NUMBER"
 END IF
 END
Code for Armstrong Number

6.  Enter a checking number ?37o
 It is an armstrong number
 Enter a checking number ? 324
 It is not an armstrong number
Output Screen

8. “Thank You”