vault backup: 2023-09-29 14:50:17

Algo/Séminaire/Exercices seminaire.md

@@ -474,6 +474,23 @@ let prime n =
 			else
 				check n (k + 1)
 		in (n = 2) || (n mod 2 = 1 and check n 3)
+(*correction*)
+let is_prime n =
+	if n < 2 then
+		invalid_arg "is_prime undefined for n < 2"
+	else
+		if n mod 2 = 0 tjen
+			n = 2
+		else
+			let rec check d =
+				if d = n then
+					true
+				else if n mod d = 0 then
+					false
+				else
+					check (d + 2);
+					check 3;;
+					
 ```
 
 ## Hanoi