Requirements

Besides the above behavior, there are the following additional requirements:

must be written in C

program must work when compiled using gcc (with no additional switches except -lm if you need sqrt)

To find the factors of a number, you can simply divide the number by consecutive integers, and see which integers divide it evenly. But rather than divide, you can use the modulus function (\%): n%f returns the remainder when n is divided by f. So if n%f==0, you know that f is a factor of n So let's write a program that accepts a number (n) from the user, analyzes it. and reports the following facts about the number: 1. a list of all factors between 1 and n1 (including 1 ); 2. a statement about whether the number is prime or composite (not prime); 3. the sum of all the factors from 1 to n1; and 4. a statement as to the mood of the number. The mood is found as follows (let's suppose s=the sum of all factors from 1 to n1) : - if sn, the number is "happy"; 1 - if s=n, the number is "perfect." So for item 4. above, your code should say the number is sad, happy or perfect<>