Question

What is the smallest and the largest number of divisions possible in the algorithm for determinig a prime number?

Answer 1

Answer


For determining a prime number the number of divisions should be--
Smallest: 2 [As the prime no. can be divisible by 1, so it should be skipped]
Largest: (Number/2) [As any no. can be divided by other nos. until they are less than the 1/2 of the no.]

Hope this help u