Write a computer program having the specified input and output.
Given any integer n greater than 1, compute the smallest prime divisor of n. (Hint: If n is odd, divide n by the odd integers greater than I until a divisor is found or Theorem 3.5 applies.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.