
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="=" result1="result1"><p>对于数字2的所有除数的总和。</p> <pre class="brush:php;toolbar:false;">for(i=1;i<number2 i="=" result2="result2+i;"><p>For the friendly pairs.</p><div class="aritcle_card flexRow artxards"> <div class="artcardd flexRow"> <a class="aritcle_card_img" rel="nofollow" href="/ai/2736" title="AgentGPT"><img src="https://img.php.cn/upload/ai_manual/001/503/042/69bb7a922c893170.png" alt="AgentGPT" onerror="this.onerror='';this.src='/static/lhimages/moren/morentu.png'" ></a> <div class="aritcle_card_info flexColumn"> <a rel="nofollow" href="/ai/2736" title="AgentGPT" class="overflowclass">AgentGPT</a> <p class="overflowclass">一款AI工具,主要用于一个基于浏览器的AI Agent创建工具,适合需要提升相关任务效率的用户。</p> </div> <a rel="nofollow" href="/ai/2736" title="AgentGPT" class="aritcle_card_btn flexRow flexcenter"><b></b><span>下载</span> </a> </div> </div> <pre class="brush:php;toolbar:false;">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 −
Live Demo
#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 if i="=" result1 result2="=number2)" printf pairs abundant><h2>输出</h2>
<p>输出如下 −</p>
<pre class="brush:php;toolbar:false;">Enter two numbers:6 28
Abundant Pairs










