Project Euler Forum

No, it's not. You're not extremely far off though..

Thanks; just fixed it. Not often I'm two out!

I must be going mad here! Does n=8 render ?????????? like I get? Sorry to ask for all these confirmations!

Thanks,
Lster

No, it's not.

With some change... Is it be it right or not, I deleted it (hk)? Man, this one is driving me mad!

You're not trying to get the values for all n here, right?

No. But these are my questioned values. I wouldn't be able to guess in a million years...

be it right or not, I deleted it (hk)

I can't really see what harm it would do, but that's fine. I'll figure it out on my own.

I found the pattern (although I have no idea why it works). It's fine for some values of n, not for others. Is there a pattern in the patterns? some n's are far more difficult than others, obviously - but how much more difficult? Are there many people who solved it for some n but not others?

Out of curiosity - can anyone solve this for U(2,25)? U(2,101)? U(2,1001)?

Thanks.

U(2,25) is calculated in the thread... the others are probably too big (101 might be feasible, I'll try later on when I get to my computer).

zwuupeape wrote:I found the pattern (although I have no idea why it works). It's fine for some values of n, not for others. Is there a pattern in the patterns? some n's are far more difficult than others, obviously - but how much more difficult? Are there many people who solved it for some n but not others?

Out of curiosity - can anyone solve this for U(2,25)? U(2,101)? U(2,1001)?

Thanks.

Yeah, I just re-checked my code from the thread. U(2,25) is easy and is done in thread, but U(2,101) and up are prohibitively expensive (at least with my Python code). Actually, my computer gave me a memory error once it got to U(2,33). So yeah... not happening.

k=10^11-1
======================
U(2,5)[k]= <snipped by modrator>
U(2,7)[k]= <snipped by modrator>
=====================
Is it true ?

I have a bit of spare time on my hands so came back to PE.

First welcome-back problem, what a doozy! Congrats to those who made this problem.

I was stuck for hours on an edge-case in my code. Really well-designed problem!