Question

Given an integer n draw flowchart to find smallest exact divisor other than 1

Answer 1

In order to find the smallest divisor of an integer say n it is pretty simple.

You would have to take 2,3,4,..n, and then divide n with each specific number in an ascending order.

But we cannot use efficeint methods since it needs more loops. In order to reduce the number of loops through various number of techniques.