vault backup: 2023-11-24 15:42:16

Algo/B2/Exercises/Repetitive tutorial.md

@@ -143,4 +143,30 @@ def my_sum(n: int) -> int:
 			j += 1
 		i += 1
 	return ss
+
+# OR
+def mu_sum(n: int) -> int:
+	ss = 0
+	si = 0
+	i = 1
+	while i <= n:
+		si += u(i)
+		ss += si
+		i += 1
+	return ss
+```
+
+## Exercise 2.1
+```
+def euclid(a, b):
+	if (a <= b):
+		raise ValueError("a must be superior to b")
+	r = 1
+	while r != 0:
+		oldr = r
+		q = a//b
+		r = a%b
+		a = b
+		b = r
+	return oldr
 ```