#
Modify the smallest-divisor
^{
}

The
`smallest-divisor`

procedure shown at the start of this section does lots of needless testing: After it checks to see if the number is divisible by 2 there is no point in checking to see if it is divisible by any larger even numbers. This suggests that the values used for
`test-divisor`

should not be 2, 3, 4, 5, 6, ..., but rather 2, 3, 5, 7, 9, .... To implement this change, define a procedure
`next`

that returns 3 if its input is equal to 2 and otherwise returns its input plus 2. Modify the
`smallest-divisor`

procedure to use
`(next test-divisor)`

instead of
`(+ test-divisor 1)`

. With
`timed-prime-test`

incorporating this modified version of
`smallest-divisor`

, run the test for each of the 12 primes found in exercise
1.22
. Since this modification halves the number of test steps, you should expect it to run about twice as fast. Is this expectation confirmed? If not, what is the observed ratio of the speeds of the two algorithms, and how do you explain the fact that it is different from 2?

```
(check-equal? (next 2) 3)
(check-equal? (next 3) 5)
(check-equal? (next 4) 6)
(check-equal? (smallest-divisor 4) 2)
(check-equal? (smallest-divisor 21) 3)
(check-equal? (smallest-divisor 1999) 1999)
```