What is a perfect number?

"Perfect number is a positive number which sum of all positive divisors excluding that number."
For example 6 is Perfect Number since divisor of 6 are 1, 2 and 3. Sum of its divisor is
1 + 2+ 3 =6
and 28 is also a Perfect Number
since 1+ 2 + 4 + 7 + 14= 28
Other perfect numbers: 496, 8128

UNDERSTANDING PRIME NUMBERS PROGRAM LOGIC

o

To make logic first think about PRIME NUMBER definition that a number which divides by 1 and itself.

So we have make a condition like that in which user will enter a number and our program will check it by
dividing it from 1 up to itself.

To check that how much times it has divided to numbers from 1 to itself we take a variable and increment
it each times when a number is divided.

In C++ CODING we take a FOR LOOP which will start from 1 up to number that has entered to check
whether it is PRIME NUMBERor not with in FOR LOOP we set an IF condition and placed counter
(count++) variable in its body so whenever a number from 1 to number which has entered to check divides
than IF condition becomes true and counter variable will be incremented.

When FOR LOOP is completed we check from IF condition that if counter variables value is equal to 2
than number is PRIME elseNUMBER IS NOT PRIME.

Because if number divided two times by 1 and itself counter variable will incremented two times if more
than two times counter variable will have value greater than 2.

1.

#include<iostream.h>

2.
3.
4.

#include<conio.h>
void main()
{

5.

//clrscr();

6.

int number,count=0;

7.

cout<<"ENTER NUMBER TO CHECK IT IS PRIME OR NOT ";

cin>>number;

8.

for(int a=1;a<=number;a++)

9.

10.

if(number%a==0)

11.

12.

count++;

13.

14.

15.
16.

if(count==2)
{

17.

cout<<" PRIME NUMBER \n";

18.

19.
20.

else
{

21.

cout<<" NOT A PRIME NUMBER \n";

22.

23.
24.

//getch();

25.