School Commit Init

2024-08-31 12:07:21 +03:00
commit 0b130ee18c
2801 changed files with 4720552 additions and 0 deletions
@@ -0,0 +1,40 @@
+def is_prime(n):
+    if n<2:
+        return False
+    for i in range(2,round(n**0.5)+1):
+            if n%i==0:
+                return False
+    return True
+
+def the_nth_element_of_sequence(n):
+    if n<=0:
+        print("Number should be an positive integer")
+        return None
+    if n==1:
+        print("The nth number in the sequence is: 1")
+        return 1
+    i=1
+    n-=1
+    while n>0:
+        i+=1
+        if is_prime(i):
+            n-=1
+            continue
+        d=2
+        j=i
+        while j>1:
+            if j%d==0:
+                n-=d
+            while j%d==0:
+                j//=d
+            if n<=0:
+                i=d
+                break
+            d+=1
+    if n<=0:
+        print("The nth number in the sequence is: {}".format(i))
+        return i
+
+if __name__=="__main__":
+    n=int(input("Please enter an positive integer number: "))
+    the_nth_element_of_sequence(n)
@@ -0,0 +1,22 @@
+#Generate the largest prime number smaller than a given natural number n. If such a number does not exist, a message should be displayed.
+
+def is_prime(n):
+    if n<2:
+        return False
+    for i in range(2,round(n**0.5)+1):
+            if n%i==0:
+                return False
+    return True
+
+def largest_prime_number_smaller_than_n(n):
+    if n < 3:
+        print("No such number exists")
+        return None
+    for i in range(n-1,0,-1):
+        if is_prime(i):
+            print("The smallest prime number smaller than {} is {}".format(n,i))
+            return i
+
+if __name__=="__main__":
+    n=int(input("Please enter an positive integer number: "))
+    largest_prime_number_smaller_than_n(n)
@@ -0,0 +1,13 @@
+def fibonacci(n):
+    f1=1
+    f2=1
+    while n>=f2:
+        aux=f2
+        f2+=f1
+        f1=aux
+    print(f2)
+    return f2
+
+if __name__=="__main__":
+    n=int(input("Please enter an positive integer number: "))
+    fibonacci(n)