Page 1 of 1
Problem 615
Posted: Mon Dec 04, 2017 10:03 pm
by beco
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...
Re: Problem 615
Posted: Thu Sep 20, 2018 9:43 am
by Jochen_P
Can someone confirm the 1000th number with at least 5 Prime Factors to be 9576 ?
thank you
Re: Problem 615
Posted: Thu Sep 20, 2018 1:03 pm
by hk
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
Re: Problem 615
Posted: Mon Oct 01, 2018 6:19 pm
by Jochen_P
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
