Story Prime

How to find the smallest prime divisor using c prog language?

The smallest prime divisor of an integer k>1 is the smallest prime number which divides k. For instance, the smallest prime divisor of 31 is 31, and the smallest prime divisor of 100 is 2. Please show your answer using cprog language. Thanks alot.

Public Comments

1. Please attempt to do this on your own. When you have written what you believe is as close as you can to a complete answer. After you have, then please repost the code here with any questions you may have.