Project Euler Forum

Let d(n) be the number of divisors of n.

Are 1 and n also considered to be divisors of n in this problem?

Why not?

Only making sure I don't miss anything

I keep getting 16739 for S(1000,10), pretty fast but obviously wrong.
This drives me mad

I'm pretty sure my algo for S() should work though. Got the wrong result for the problems answer in about 126 seconds

Anyone keen to give a second pair of eyes on my python code, or experienced the same dead end and give a hint?

Jochen_P wrote: Mon Dec 03, 2018 5:38 pm I keep getting 16739 for S(1000,10), pretty fast but obviously wrong.
This drives me mad

You might want to reconsider the number of divisors you compute for perfect squares...

Hi Ken,

good hint, but my Divisor Count function is ok (got the correct result for S(1000,10) by doing it the naive way, which would take days for the original Problem)

There is something obvious wrong with my S() implementation which I just don't see yet .. proofed only test cases yet, maybe there are exceptions I don't have realized yet.
Will run it with lower bounds and debug prints tonight

Crickey!

this was a real brainf* regarding zero based indexes and bounds and predictive computing in reachable ranges.
Brain hurts big time, but now I got the test case correct (below 1 msec)

[edit] sure enough my final answer is still wrong! I hate this problem [/edit]

Finally!

one minor tweak made it general use ... Phew, that was hard work. [you may visit the problems forum post #91 to make fun of me ]
Now only one to go to reach level 8

Jochen_P wrote: Tue Dec 04, 2018 2:08 pm Finally! Now only one to go to reach level 8