!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(!^$%&*(*^&%^#$^%&*(&^$%#%^&*(

C++ pls!

Assignment Overview This assignment will give you more experience on the use of loops and conditionals, and introduce the use of functions Background There are all sorts of special numbers, much like perfect numbers that we saw in Python. Take a look sometime at http://mathworld.wolfram.com/topics/SpecialNumbers.html for a big list. One such class of numbers is called Achilles Numbers. Great name! An Achilles has two special features based on its prime factors using some unusual named properties of numbers: e the number should be powerful e the number should not be a perfect power Lets look at all three of those properties Prime Factors The prime factors of any integer should be familiar. You find all the prime integers that divide exactly (without remainder) into an integer. We exclude 1 (which is a factor of every integer) and the number itself (which, again, is a prime factor of every particular number) for example, the prime factors of 30 are 2,3,5 since 2*3*5-30. Note that 6, 15 and 10 are also factors but they are not prime factors take a look at https://en.wikipedia.org/wiki/Table of prime factors for a table of the prime factors of many numbers. Powerful Number A powerful number is an integer with the following property. For every prime factor in the number, the square of the prime factor must divide exactly (without remainder) into the original number 30 is not a powerful number. Its prime factors are 2,3,5. 22 does not divide exactly into 30, 32 does, 52 does not. All of the factors squared must divide exactly into the number for it to be powerful 72 is a powerful number. Its prime factors are 2,3 (233 72). 22 divides exactly into 72 (18 * 4) as does 32 (9 * 8). https://en.wikipedia.org/wiki/Powerful number gives a list of powerful numbers. Perfect Power A perfect power number is an integer that can be expressed as a single expression of the form m*. That is, there is some integer m which, raised to the integer power k, is the integer n in question. Project Description / Specification Warnin First, a warning. In this and in all future projects we will provide exactly our function specifications the function name, its return type, its arguments and each argument's type. The functions will be tested using the main we provide for you. If you do not follow the function specifications, these independent tests of your functions will fail. Do not change the function declarations! Provided Main Since we provide the main, there is a file skeleton. cpp that you should use to start your program. It contains the provided main, you simply add your functions to that file Warning!!! You have to use the provided main in your code. If you modify the provided main in any way you will receive a 0 for the project. Functions function: is_prime: return is bool. Argument is a single long n. If n is prime it returns true, otherwise it returns false function: is_powerful: return is bool. Argument is a single long n. If n is powerful it returns true, otherwise it returns false. Utilizes is_prime (or should) function: is_perfect_power: return is bool. Argument is a single long n. If n is a perfect power it returns true, otherwise it returns false function: is_achilles: return is bool. Argument is a single long n. If n is an Achilles number it returns true, otherwise it returns false. Utilizes is_powerful and is perfect_power (or should). Function Tests Using the provided main we can test each function individually. You should be doing the same, so consider this a template for testing functions in the future Hidden Tests Starting with project 3 some of the tests on Mimir will be "hidden". By that we mean that the input and output required to pass the test are not shown. There are plenty of tests you can see, but one for each function where you cannot. This makes sense. You have to write your code to the specifications, not to the tests you can see Deliverables proj03/proj03.cpp -- your source code solution including the provided main. 1) Be sure you turn in the directory proj03/proj03.cpp to Mimir 2) The main is provide and you should not modify it, only add to it in the places indicated 3) Save a copy of your file on the EGR file space. This is the only way we can check that you completed the project on time in case you have a problem with Mimir General Hints: 1. You can write as many functions are you like over and above the ones I have specified. Make sure you write the requested functions exactly as specified. They will be tested individually according to that specification. a. 2. The functions all return Booleans, which is not very informative. Feel free to place lots of output statements in your functions so you can see what is going on. a. Just remember to remove the output statements before you turn in the code!!! 3. The main will take in test cases to test each function. You already have the main, so develop the functions one at a time and run the appropriate test case to see that the function works! Don't write everything all at once, write one function at a time, test it and make sure it workS. a. Specific Hints If we were more knowledgeable about algorithms we could discuss how to be efficient about these checks, but for now we would just like them to work. Here are some pretty specific suggestions, but feel free to work it out for yourself 1s_ prime * You can check every number from 2 up to the n-1 and see if any of those numbers divides without remainder. If so, then it isn't prime. Otherwise it is you can be more efficient. What value do you really need to check up to (less than n-1)? break can save you some computational time here o o 1s powerful: First, no prime number is ever powerful. Check every number from 2 to n-1 if it divides without remainder into n, then it is a factor, for all of those factors that are prime, then o if the square of that factor also divides without remainder into n, it is a powerful number * otherwise not powerful is perfect power There are a couple ways to approach tis e check all combinations of base to some power that makes sense Outer loop goes from 2 to some limit. This is the base Inner loop. raise base to power. powers start at 2. check 2"2, then 243, then 2 4 until the value exceeds the value of n. inner loop ends, check the next base: (3 2, 3 3, etc.) o o check all the integer power roots e o o o o check powers from 2 to some limit find the various roots (square root, cube root, etc.) by taking the pow (n, 1.0/power) turn the root into an integer (round in cmath is helpful) see if the now integer root raised to the power being checked is equal to n. is achilles: if n is powerful but not a perfect power, then it is an Achilles number *