By DePaul Dimadis
Choose your prefered Language: greek_flag uk_flag

Write code in C language for the following algorithm:
1. Create a positive random number m: 2 <= m <= 1500
2. Find all the m dividers that are prime numbers, based on the code that is
is set out below
3. Determine the number n that will be the product of the original divisors of the number m with
unnecessary number of impressions. Any such true divisor will only participate once in
determining the number n.
4. Determine the number z = m * n
5. Find the number k that holds that k 2 = m * n
6. Show the numbers m, n, k