HELP ASAP!
i dont know how to do this. Can anyone help?
Write a C++ program that finds the smallest divisor of a number or determines if that number is a prime number. The program reads a number from the user via the keyboard and invokes a function named find_div() that returns the smallest divisor of n that is greater than 1. Otherwise, if n is a prime number, find_div() will simply return n as prime number. Do you want to search more (y/n) => y
Write a C++ program that finds the smallest divisor of a number or determines if that number is a prime number. The program reads a number from the user via the keyboard and invokes a function named find_div() that returns the smallest divisor of n that is greater than 1. Otherwise, if n is a prime number, find_div() will simply return n as prime number. Do you want to search more (y/n) => y
Please do not make more than one post for the same question.
You already have a thread here: http://www.cplusplus.com/forum/general/63503/
You already have a thread here: http://www.cplusplus.com/forum/general/63503/
If a topic is posted in the wrong area you can always click Edit Topic at the top and move it. (Yes, users can move their own topics on this forum :D)
Topic archived. No new replies allowed.