Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- N=1001
- def horner(poly, n, x):
- result = poly[0]
- for i in range(1, n):
- result = result*x + poly[i]
- return result
- def polymult779():
- for a0 in [1,2,3]:
- for a1 in [1,2,3]:
- for a2 in [1,2,3]:
- for a3 in [1,2,3]:
- for a4 in [1,2,3]:
- for a5 in [1,2,3]:
- for a6 in [1,2,3]:
- for a7 in [1,2,3]:
- for a8 in [1,2,3]:
- for a9 in [1,2,3]:
- for a10 in [1,2,3]:
- poly=[a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10]
- p=horner(poly,11,10)
- if(p % 779 ==0):
- print(p)
- def espmaxnumonly1():
- for i in range (0,N):
- if(((10**(N-i)-1)//9)%779==0):
- return N-i
- m=N-espmaxnumonly1()
- print("Massimo esponente n di (10^n-1)/9 composto di soli 1 divisibile per 779:")
- print(espmaxnumonly1())
- print("Minimo numero di cifre da attaccare a quello di soli 1:")
- print(m)
- print("Lista numneri di 11 cifre conteneti 1,2,3 divisibili per 779")
- polymult779()
Advertisement
Add Comment
Please, Sign In to add comment