Program stop at i=95

First time here? Check out the FAQ!

factoring

jarkky
41 ●5

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)

add a comment

1 Answer

Sort by » oldest newest most voted

answered 3 years ago

jarkky
41 ●5

ok. so It seems it was very difficult case and now finally solved as:

i= 95 , n= 314159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534212 , p= 2^2 * 739 * 31131749433799663827607439757630227817061 * 3413830204918052760918536918030179296524059816063007

link

Comments

Please accept this answer to mark the question as solved. For that, click the "accept" button near the answer (the button with a check mark).

slelievre ( 3 years ago )

add a comment

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 3 years ago

Seen: 188 times

Last updated: Apr 06 '22

Program stop at i=95 savecancel

1 Answer

Comments

Your Answer

Question Tools

Stats

Related questions