diff --git "a/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t25.py" "b/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t25.py"
new file mode 100644
index 0000000..d343d3b
--- /dev/null
+++ "b/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t25.py"
@@ -0,0 +1,10 @@
+#первый факториал, количество цифр которого равно 1000
+from math import ceil, log10
+a, b = 0, 1
+i = 0
+while 1:
+	i += 1
+	a, b = b, a + b
+	if ceil(log10(a)) == 1000: 
+		break
+print(i)
\ No newline at end of file
diff --git "a/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t41.py" "b/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t41.py"
new file mode 100644
index 0000000..9e52c4e
--- /dev/null
+++ "b/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t41.py"
@@ -0,0 +1,21 @@
+import itertools
+
+#проверка на простое число
+def isPrime(n):
+    if n % 2 == 0:
+        return n == 2
+    d = 3
+    while d ** 2 <= n and n % d != 0:
+        d += 2
+    return d ** 2 > n
+
+#вернет самое большое простое пан-число
+def getMaxPrPand(s):
+	for n in range(10,1,-1):
+		for i in itertools.permutations(s,n):
+			if isPrime(int(''.join(i))):
+				return (''.join(i))
+
+print(getMaxPrPand("7654321"))
+
+
diff --git "a/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t9.py" "b/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t9.py"
new file mode 100644
index 0000000..7dfe155
--- /dev/null
+++ "b/\320\243\321\200\320\276\320\272\320\270/1/\320\272\320\276\320\264/t9.py"
@@ -0,0 +1,11 @@
+from math import sqrt
+
+#вернет произведение пифагорейских чисел, чья сумма равна 1000
+def getMulThPifo():
+	for a in range(1,1000):
+		for b in range(1,1000):
+				c = sqrt(a**2+b**2)
+				if a + b + c == 1000:
+					return int(a*b*c)
+
+print(getMulThPifo())
\ No newline at end of file