Question: [Ocaml Language] Please solve this question by completing (*TODO*) in this code: (* problem 2*) let smallest_divisor : int -> int = fun n ->
[Ocaml Language]
Please solve this question by completing (*TODO*) in this code:
(* problem 2*) let smallest_divisor : int -> int = fun n -> (*TODO*)
![[Ocaml Language] Please solve this question by completing (*TODO*) in this code:](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3c3c3e2a49_39566f3c3c369f47.jpg)
Problem 2 (10pts) Write a function smallest divisor: int -> int that finds the smallest integral divisor (greater than 1) of a given number n. For example, smallest-divisor 15 = 3 smallest.divisor 121 -11 smallest-divisor 141-3 smallest-divisor 199-199 Ensure that your algorithm runs in (Vn) steps
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
