Skip to main content

Write a C program to find number is Abundant number or not

 

Write a C program to find the number is an Abundant number or not:-




In this program to find a number is an Abundant number or not. A number n is said to be an Abundant Number to follow these condition

  • the sum of its proper di


    visors is greater than the number itself.
  • And the difference between these two values is called abundance.

Ex:- Abundant number  12 having a proper divisor is 1,2,3,4,6 the sum of these factors is 16 it is greater than 12 so it is an Abundant number.

Some other abundant numbers

    18, 20, 24, 30, 36, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120..

ALGORITHMS:-

Step 1- Enter the number, to find the Abundant number.
Step 2- Initialize the loop with c=1 to c<=number and follow the following calculation
     (i) check if whether the number is divisible with c and c got a result zero.
     (ii) now sum=sum+c, add a digit into a sum and store it in the sum.

Step 3. then the checksum is greater than the number print true.

Step 4. else it is not an abundant number
Step 5- Stop.

 Code:-

#include<stdio.h>
int main()
{
      //initialization variables
       int number,sum=0,c;
     //input from user
     printf("Enter a number : "); 
      scanf("%d",&number);
    //declare a variable to store sum of factors of the number
     for(c = 1 ; c < number ; c++)
     {
           if(number % c == 0)
              //sum+=c;
               sum = sum + c;
     }
     if(sum > number)
          //display the result
           printf("Abundant Number");
     else
       //display  
         printf("Not an Abundant Number");

    return 0;
}
























OUTPUT:










 FOLLOW AND SUBSCRIBE THIS WEBPAGE FOR 
 MORE NEW PROGRAMS AND CODING SOLUTIONS.






























Comments

Popular posts from this blog

Data Structure Multiple Choice Questions and Answers

  Data Structure Multiple Choice Questions and Answers Our 1000+ multiple choice questions and answers (MCQs) on "Data Structure - I" (along with 1000+ MCQs on "Data Structure - II (Algorithms)") focus on all areas of Data Structure covering 200+ topics. One can read MCQs on Data Structure - II (Algorithms)                 Array and Array Operations This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Array and Array Operations”. 1. Which of these best describes an array? a) A data structure that shows a hierarchical behavior b) Container of objects of similar types c) Arrays are immutable once initialised d) Array is not a data structure View Answer Answer: b Explanation: Array contains elements only of the same type. 2. How do you initialize an array in C? a) int arr[3] = (1,2,3); b) int arr(3) = {1,2,3}; c) int arr[3] = {1,2,3}; d) int arr(3) = (1,2,3); View Answer Answer: c Explanation: This is the syntax ...

HackerRank Tuples Solution in Python

  HackerRank Tuples Solution in Python Task Given an integer,n, and n  space-separated integers as input, create a tuple, t, of those n integers. Then compute and print the result of hash(t). Note:   hash()  is one of the functions in the  __builtins__  module, so it need not be imported. Input Format The first line contains an integer,n, denoting the number of elements in the tuple. The second line contains n space-separated integers describing the elements in tuple t . Output Format Print the result of  hash(t) . Sample Input 0 2 1 2 Sample OUTPUT- 3713081631934410656 n = int(input()) int_list = [int(i) for i in input().split()] int_tuple = tuple(int_list) print(hash(int_tuple))

Chakra Vyuh Bhedna, the only answer to how to crack group discussions!

  Chakra Vyuh Bhedna, the only answer to how to crack group discussions! Because of the pandemic, the placement drive was conducted virtually. And to add to the difficulty level, more than 200 students participated in the drive. The selection process consisted of an online test that included the aptitude and technical questions, which was followed by a group discussion. Both were elimination rounds. The shortlisted students were then called for the final round, the personal interview. All about cracking group discussions and interviews My strategy was to be attentive in the pre-placement talks by asking questions to them and even trying to answer their questions. This helped me to boost my self-confidence and made me perform well during the Group Discussion. For cracking group discussion, I practiced a simple and powerful technique called  Chakra Vyuh Bhedna . It's a complete weapon to crack any GD. This technique has 4 parts.  Awareness of the topic Understanding PE...