project_euler_solution_added

Author: ashutosh321607

Project Euler/python/problem44.py

@@ -0,0 +1,22 @@
+import math
+
+def pantaNumber(ver):
+  return (ver*(3*ver-1))/2
+
+n =  2500
+
+panta = []
+
+for i in range(1,n+1):
+  panta.append(pantaNumber(i))
+
+for i in range(1,n):
+  print("value of i =",i)
+  for j in range(n-i):
+    print("value of (i,j)",(i,j))
+    if panta[j+i]+panta[j] in panta:
+      if panta[j+i]-panta[j] in panta:
+        print("the smallest value D =",panta[j+i]-panta[i])
+        quit()
+
+        

Project Euler/python/problem45.py

@@ -0,0 +1,41 @@
+# n = int(input("Give the value of n "))
+
+n = 1000000
+
+prime = [True for i in range(n+1)] 
+p = 2
+while (p * p <= n): 
+  if (prime[p] == True):
+    for i in range(p * 2, n+1, p): 
+      prime[i] = False
+  p += 1
+
+primeNum = []
+for p in range(2, n): 
+  if prime[p]: 
+    primeNum.append(p)
+
+
+def NumOfPrimeFact(n):
+  count=0
+  j = 0
+  while(n!=1):
+    if(n%primeNum[j]==0):
+      count+=1
+      while(n%primeNum[j]==0):
+        n/=primeNum[j]
+    j+=1
+  return count
+
+k  = int(input("give the value of prime factors: "))
+
+i = 1
+flag = 0
+while(flag<k):
+  if(NumOfPrimeFact(i)==k):
+    flag+=1
+  else:
+    flag = 0
+  i+=1
+
+print("\n\n\t\t*****first number is =",i-k,"*****\n\n")

Project Euler/python/problem668.py

@@ -0,0 +1,72 @@
+import math
+import time
+start_time = time.time()
+
+n = int(input("Give the value of n : "))
+k = math.ceil(math.sqrt(n))
+
+#genrating prime numbers
+
+prime = [True for i in range(k+1)] 
+p = 2
+while (p * p <= k): 
+  if (prime[p] == True):
+    for i in range(p * 2, k+1, p): 
+      prime[i] = False
+  p += 1
+
+#storing numbers in a list
+primeNum = []
+
+for p in range(2, k): 
+  if prime[p]: 
+    primeNum.append(p)
+
+count = 0
+
+# test Code
+
+
+# for i in range(1,n+1):
+#   j = 0
+#   temp = i
+#   while(temp!=1):
+#     if(primeNum[j]>=math.sqrt(i)):
+#       break
+#     if(temp%primeNum[j]==0):
+#       temp//=primeNum[j]
+#     else:
+#       j+=1
+#       if(j==len(primeNum)):
+#         break
+#     if(temp==1):
+#       count+=1
+#       print(i) # printing value of smooth sqrt numbers
+
+#Adding 1 because of the number 1 is a smooth sqrt number 
+
+# print("\n\t**Value of smooth square root number below",n,"=",count+1,"**")
+
+
+#Optimised code
+x = 0
+for i in range(1,n+1):
+  if(primeNum[x]<math.sqrt(i)):
+    x+=1
+  j = x
+  while(j<k-1):
+    if(primeNum[j]<=i):
+      if(i%primeNum[j]==0):
+        count-=1
+        print("in")
+        break
+    else:
+      break
+    j+=1
+  count+=1
+  print("out")
+
+  
+print("\n\t**Value of smooth square root number below",n,"=",count,"**")
+
+print("--- %s seconds ---" % (time.time() - start_time))

Project Euler/python/problem686.py

@@ -0,0 +1,15 @@
+a = int(input())
+
+n = 2
+myvalue = 0
+i = 1
+while(True):
+  i+=1
+  n*=2
+  n = int(str(n)[:15])
+  if(str(n)[:3]=='123'):
+    myvalue+=1
+  if(myvalue==a):
+    break
+print(i)
+