vault backup: 2023-11-27 13:46:08

Algo/B2/Exercises/Repetitive tutorial.md

@@ -187,6 +187,33 @@ def mirror(n: int) -> int;
 	return res
 ```
 
+## Exercise 2.3
+```python
+def factorial(limit: n) -> int:
+	n = 0
+	if limit <= n:
+		return n
+	else:
+		f = 1
+		while f < limit:
+			n += 1
+			f *= n
+		if n % 2 == 0:
+			return (n-2)
+		else:
+			return (n-1)
+```
+
+## Exercise 2.4
+```python
+def prime(n: int) -> int:
+	"""
+	Check if n(int) is prime if n > 1, error otherwise
+	"""
+	if n <= 1:
+		raise Exception("prime: n<= 1")
+	elif n % 2 == 0:
+		return n == 2
 ## Exercise 3.3
 ```python
 def quotient(a: int, b: int) -> int: