Skip to main content

How to find the Factor of any number in C

 How to find the Factor of any number in c: -

We will calculate the factors of any numbers using C programming.
The factors of a number are defined as the number we multiply two numbers and get the original number. The factor of a number is a real number that divides the original completely with zero remainders.

ALGORITHM: -

Step 1- Enter the number, to find their factor.

Step 2- Initialise the loop with u=1 to u<=number and follow the following calculation

      (i) check whether the number is divisible with u and u got a result zero.

      (ii) now print the value of u. From this loop, u got all the factors of the number.

Step 3- Stop.

CODE:-

#include<stdio.h>//header file
int main()
{
    int i,num;//variable declaration
    printf("Enter the num to find their factor: ");
    scanf("%d",&num);//to take user input
    for(i=1;i<=num;i++)//for loop for coondition
    {
        if(num%i==0)//check num is perfect divided or not
        {
            printf("factor is %d \n",i);//print value of factor
        }
    }
    return 0;
}

OUTPUT:-












FOLLOW THIS WEBPAGE FOR MORE NEW PROGRAMS AND CODING SOLUTIONS. 

Comments

Popular posts from this blog

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...

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 ...

How to Check Whether a Number is Prime Number or Not in C

  How  to Check Whether a Number is Prime Number or Not in C:-  A number is considered as a prime number when it satisfies the below conditions.  A prime number is a number that can be divided by 1 and itself A number that can not be divided by any other number other than 1 or itself is a prime number. It should have only 2 factors. They are 1 and the number itself. ALGORITHMS:-                                               Step 1 . Read a “num” value to check prime or not. Step 2 . set i=1,div=0. Step 3 . if i<=num if true go to step 4, else go to step 7. Step 4 . Check the condition num%i==0 if true then evaluate step 5, else go to step...