diff --git a/11/faktorial_rekurze.py b/11/faktorial_rekurze.py
new file mode 100644
index 0000000..d4e5fdd
--- /dev/null
+++ b/11/faktorial_rekurze.py
@@ -0,0 +1,20 @@
+# 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))
diff --git a/11/fibonacci.py b/11/fibonacci.py
new file mode 100644
index 0000000..e69de29
diff --git a/11/fibonacci_rekurze.py b/11/fibonacci_rekurze.py
new file mode 100644
index 0000000..14b0c5b
--- /dev/null
+++ b/11/fibonacci_rekurze.py
@@ -0,0 +1,6 @@
+# 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
+
diff --git a/11/rekurze.md b/11/rekurze.md
new file mode 100644
index 0000000..e69de29