## Problem 615

A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you
are requested to be thoughtful in not posting anything
that might explicitly give away how to solve a particular problem.

This forum is NOT meant to discuss solution methods for a problem.

In particular don't post any code fragments or results.

Don't start begging others to give partial answers to problems

Don't ask for hints how to solve a problem

Don't start a new topic for a problem if there already exists one

Don't post any spoilers
beco
Posts: 4
Joined: Sat Dec 02, 2017 7:44 pm
Contact:

### Problem 615

Congratulations to the first 100!

I've tried, but due to lots of not so much prime factors, I couldn't!

I'm specially amused by the time achieved by the Japanese flag user uwi. Just 10 minutes!

That got me thinking...

Jochen_P
Posts: 50
Joined: Mon Oct 05, 2009 9:47 am
Location: Stuttgart, Germany

### Re: Problem 615

Can someone confirm the 1000th number with at least 5 Prime Factors to be 9576 ?
thank you

hk
Posts: 10303
Joined: Sun Mar 26, 2006 9:34 am
Location: Haren, Netherlands

### Re: Problem 615

This simple program tells you the answer:

Code: Select all

def primefactorcnt(n):
res=0
f=2
while n>1:
while n%f==0:
n/=f
res+=1
f+=1
return res
cnt=0
for n in xrange(2,10000):
k=primefactorcnt(n)
if k>=5:
cnt+=1
if cnt==1000:
print n
break


Jochen_P
Posts: 50
Joined: Mon Oct 05, 2009 9:47 am
Location: Stuttgart, Germany

### Re: Problem 615

well, yeah, sure. Thanks
should've seen the ease of selftesting.

Now to find out where and why the easy to spot pattern from the example values breaks