AMICABLE PAIRS

Two numbers form Amicable Pairs  if sum of proper divisors of  1st is equal to the 2nd and vice-versa.It is assumed that these two numbers should be distinct,

Example : Let two number 220 And 284 ,
      Sum of proper Divisor of 220 := 1+2+4+5+10+11+20+22+44+55+110 = 284
      Sum of Proper Divisor of 284 :=1+2+$+71+142=210 .
 That's Why 220 & 284 form amicable number pair .

Note : ( 220 , 284 ) smallest Amicable Number Pair . 

Related Post :  test your programming skill P-2

Related Post : How to host your website for FREE (google drive )

Related Post : How to get ip address of user in PHP

C Code to find Amicable Number in GIven Range : 

1. #include<stdio.h>  
2.  #include<conio.h>  
3.  void main()  
4.  {  
5.    long int range, test, chk, div, sum, n1, n2;  
6.    printf("\n\t Enter the Range to Check Amicable Numbers :-");  
7.    scanf("%ld",&range);  
8.    test = 0;  
9.    while( ++test < range )  
10.    {  
11.        sum = div = 0;  
12.        while( ++div <= (test / 2) )  
13.        {  
14.            if( test % div == 0 )  
15.              sum += div;  
16.        }  
17.        chk = sum;  
18.        sum = div = 0;  
19.        while( ++div <= chk/2 )  
20.        {  
21.            if( chk % div == 0 )  
22.              sum += div;  
23.        }  
24.        if( sum == test )  
25.        {  
26.          if( test == chk )  
27.             continue;  
28.          n1 = test;  
29.          if( n1 == n2)  
30.             continue;  
31.          n2 = chk;  
32.          printf("\t%d\t%d\n", n1, n2);  
33.        }  
34.    }  
35.   getch();  
36.  }

Its algorithm is very simple . We choose each number in given range & find sum of its divisor . & check it is amicable pair or NOT but keep in mind that this is slowest approach to do find amicable number . Now Open your mind & Improve this program . (Y)

OUTPUT:

Related Post : An illustration of Calling a Function in C

THANK YOU...........