question 1 : Divisors develop a code using modulo operator (%) to print out all the divisors of a user entered number. Your program should prompt the user to enter a positive number or 0 to end. Using a loop variable that starts at 1, your program should print out all the divisors of the entered number plus the number of printed divisors and their sum. For example: This program identifies and displays divisors of a given number. Developed as an IPC144 project. Enter a positive number. Enter 0 to end: 15 1 3 5 15 4 divisors sum of divisors: 24 Enter a positive number. Enter 0 to end: 36 1 2 3 4 6 9 12 18 36 9 divisors sum of divisors: 91 Enter a positive number. Enter 0 to end: 43 1 43 2 divisors sum of divisors: 44 Enter a positive number. Enter 0 to end: 0 Thanks and bye! question 2: Divisor counter develop a c code qsing what you did in question1,to develop a function called unsigned divisorCount (unsingned num) That gets an integer number as an input parameter and returns the number of divisors of that number. For example, if you send 15 to the function, it will return 4 as 15 has 4 divisors: 1, 3, 5, 15 The function will return 2 for 17 because 17 only has two divisors question 3.Prime number Using the function you developed in part 2, write a int isPrime(unsigned num) That gets a number as a paremeter and returns 1 if the number is prome and returns 0 if the number is not prome. Use this function to write a code that gets a number from the user and prints all the prime numbers smaller and equal to that number A sample run of your code should look like: Please enter a positive integer number (0 to end): 12 Primes before 12 are: 2 3 5 7 11 5 Prime numbers smaller than 12 Please enter a positive integer number (0 to end): 7 Factors of 7 are: 2 3 5 7 4 prime numbers smaller than 7 Please enter a positive integer number (0 to end): 0 Thanks and have a good day! Hint: This question is divide to three-small question each of the questions is individual and the answer for each of the question will need to link together with a c code and output
Types of Loop
Loops are the elements of programming in which a part of code is repeated a particular number of times. Loop executes the series of statements many times till the conditional statement becomes false.
Loops
Any task which is repeated more than one time is called a loop. Basically, loops can be divided into three types as while, do-while and for loop. There are so many programming languages like C, C++, JAVA, PYTHON, and many more where looping statements can be used for repetitive execution.
While Loop
Loop is a feature in the programming language. It helps us to execute a set of instructions regularly. The block of code executes until some conditions provided within that Loop are true.
question 1 : Divisors
develop a code using modulo operator (%) to print out all the divisors of a user entered number. Your program should prompt the user to enter a positive number or 0 to end. Using a loop variable that starts at 1, your program should print out all the divisors of the entered number plus the number of printed divisors and their sum.
For example:
This program identifies and displays divisors of a given number.
Developed as an IPC144 project.
Enter a positive number. Enter 0 to end: 15
1 3 5 15
4 divisors
sum of divisors: 24
Enter a positive number. Enter 0 to end: 36
1 2 3 4 6 9 12 18 36
9 divisors
sum of divisors: 91
Enter a positive number. Enter 0 to end: 43
1 43
2 divisors
sum of divisors: 44
Enter a positive number. Enter 0 to end: 0
Thanks and bye!
question 2: Divisor counter
develop a c code qsing what you did in question1,to develop a function called
unsigned divisorCount (unsingned num)
That gets an integer number as an input parameter and returns the number of divisors of that number. For example, if you send 15 to the function, it will return 4 as 15 has 4 divisors: 1, 3, 5, 15
The function will return 2 for 17 because 17 only has two divisors
question 3.Prime number
Using the function you developed in part 2, write a
int isPrime(unsigned num)
That gets a number as a paremeter and returns 1 if the number is prome and returns 0 if the number is not prome.
Use this function to write a code that gets a number from the user and prints all the prime numbers smaller and equal to that number
A sample run of your code should look like:
Please enter a positive integer number (0 to end): 12 Primes before 12 are: 2 3 5 7 11
5 Prime numbers smaller than 12
Please enter a positive integer number (0 to end): 7 Factors of 7 are: 2 3 5 7
4 prime numbers smaller than 7
Please enter a positive integer number (0 to end): 0
Thanks and have a good day!
Hint: This question is divide to three-small question each of the questions is individual and the answer for each of the question will need to link together with a c code and output
Trending now
This is a popular solution!
Step by step
Solved in 7 steps with 2 images
