diff --git a/11/faktorial_rekurze.md b/11/faktorial_rekurze.md
new file mode 100644
index 0000000..9f746cd
--- /dev/null
+++ b/11/faktorial_rekurze.md
@@ -0,0 +1,23 @@
+# faktorial_rekurze.py
+```python
+# tady budeme resit faktorial rekurzivne
+# matematicka definice :
+#f(0) = 1
+#f(n) = n * f(n - 1)
+# takze vidime rekurzi - muzeme vyuzit
+
+def f(n):
+	if n == 0: # f(0) = 1
+		return 1
+	# tady nepotrebujeme else, jelikoz v predchozim
+	# if-u je return
+	return n * f(n - 1) # f(n) = n * f(n - 1)
+
+print(f(3)) # f(3) = 6
+# f(3) = 3 * f(2) = 3 * 2 * f(1) = 3 * 2 * 1 * f(0) = 3 * 2 * 1 * 1 = 6
+
+print(f(100)) # je to celkem v pohode, az na to ze python neni uplne
+# dobrej pokud jde o rekurzi
+# zkuste treba co se stane kdyz udelate :
+#print(f(1000))
+```
\ No newline at end of file
diff --git a/11/fibonacci.md b/11/fibonacci.md
new file mode 100644
index 0000000..e2f2ee6
--- /dev/null
+++ b/11/fibonacci.md
@@ -0,0 +1,3 @@
+# fibonacci.py
+```python
+```
\ No newline at end of file
diff --git a/11/fibonacci_rekurze.md b/11/fibonacci_rekurze.md
new file mode 100644
index 0000000..705576f
--- /dev/null
+++ b/11/fibonacci_rekurze.md
@@ -0,0 +1,9 @@
+# fibonacci_rekurze.py
+```python
+# tahle vypada fibonacciho posloupnost :
+0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... # atd
+# zacneme matematickou definici :
+#f(0) = 0
+#f(1) = 1
+
+```
\ No newline at end of file
diff --git a/README.md b/README.md
index 9bfdb9d..61c0d13 100644
--- a/README.md
+++ b/README.md
@@ -49,6 +49,12 @@ Učí profesor Kubis a docent Veškrna.
 
 ## [10](10)
 
+## 11
++ [faktorial_rekurze](11/faktorial_rekurze)
++ [fibonacci](11/fibonacci)
++ [fibonacci_rekurze](11/fibonacci_rekurze)
++ [rekurze](11/rekurze)
+
 ## 
 + [code_gen](code_gen)
 + [site_gen](site_gen)