When I run the below code, the computer stopped at i=95:
for i in range(1,200):
n=round(pi*10^i);
p=factor(n)
print("i=",i,", n=",n,", p=",p)
Not sure why it happens or if that really is very slow case to process...
1 | initial version |
When I run the below code, the computer stopped at i=95:
for i in range(1,200):
n=round(pi*10^i);
p=factor(n)
print("i=",i,", n=",n,", p=",p)
Not sure why it happens or if that really is very slow case to process...
When I run the below code, the computer stopped at i=95:
for i in range(1,200):
n=round(pi*10^i);
p=factor(n)
print("i=",i,", n=",n,", p=",p)
Not sure why it happens or if that really is very slow case to process...
This case if I used Wolfram Alpha it gives as: factor (round(pi*10^95)) 2^2×739×106278506549045779379656406741525807990431982387520494620261995680237361511712077084845562427 (2 distinct prime factors, 1 distinct composite factor)