Question: Factor an input integer into it's prime numbers. Create a structure to hold the array of prime numbers. Any number between [2,10000] will be a
| Factor an input integer into it's prime numbers. Create a | |
| structure to hold the array of prime numbers. Any number between | |
| [2,10000] will be a valid number to check for prime factors. | |
| struct Prime{ | |
| unsigned char prime; | |
| unsigned char power; | |
| }; | |
| struct Primes{ | |
| Prime *prime; | |
| unsigned char nPrimes; | |
| }; | |
| Output the number and it's primes -> 120 = 2^3 * 3^1 * 5^1 | |
| So create a function | |
| Primes *factor(int);-> Input an integer, return all prime factors | |
| void prntPrm(Primes *); -> Output all prime factors |
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
