#-*- coding:utf-8 -*- import numpy as np from datetime import datetime def Euler76(A, n): A[0][0] =1 for i in xrange(n): for j in xrange(i + 1): if j == 1: A[i,j] = 1 elif (i == j): A[i,j] = 1 else: A[i, j] = A[i-j, j] + A[i-1][j-1] return…

#-*- coding:utf-8 -*- from datetime import datetime import random import numpy as np #素数判定 def is_prime3(q,k=50): q = abs(q) if q == 2: return True if q < 2 or q&1 == 0: return False d = (q-1)>>1 while d&1 == 0: d >>= 1 for i in xrange…

editing now.....I'm gonna introduce some methods for optimization problems..... Newton method Lenvenberg_marquard method Conjugate Gradient method #-*- coding:utf-8 -*- import numpy as np def Jacobian(x): return np.array([.4*x[0],2*x[1]]) …