Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
C program to verify if the numbers are abundant(friendly) or not?
In this program, we are trying to check whether the two given numbers by the user through console, are friendly pair or not?
Example
If sum of all divisors of number1 is equal to number1 and sum of all divisors of number2 is equal to number2, then we can say, those two numbers are abundant numbers.
The logic that we used to find friendly pairs is as follows −
For the sum of all divisors of number 1.
for(i=1;i<number1;i++){
if(number1 % i == 0){
result1= result1 +i;
}
}For the sum of all divisors of number 2.
for(i=1;i<number2;i++){
if(number2 % i == 0){
result2=result2+i;
}
}For the friendly pairs.
if(result1==number1 && result2==number2)
If this condition is satisfied, then they are abundant pairs, otherwise they are not.
Example
Following is the C program to find whether the given numbers are abundant pairs or not −
#include<stdio.h>
int main(){
int number1,number2,i;
printf("Enter two numbers:");
scanf("%d%d",&number1,&number2);
int result1=0,result2=0;
for(i=1;i<number1;i++){
if(number1 % i == 0){
result1= result1 +i;
}
}
for(i=1;i<number2;i++){
if(number2 % i == 0){
result2=result2+i;
}
}
if(result1==number1 && result2==number2)
printf("Abundant Pairs");
else
printf("Not abundant Pairs");
return 0;
}Output
The output is mentioned below −
Enter two numbers:6 28 Abundant Pairs
Updated on: 13-Mar-2021
494 Views
Advertisements