Search found 52 matches

by Jochen_P
Tue Mar 26, 2019 7:39 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 662
Replies: 6
Views: 1215

Re: Problem 662

Arrgh, cannot unsee this.

*Autistic screeching :mrgreen:
by Jochen_P
Tue Jan 29, 2019 7:07 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 084
Replies: 29
Views: 7972

Re: Problem 084

Well, I sit here and are completely baffled. Got desperate and tried my code with two 4-sided die, and guess what; Green Tick :shock: [edit] an admin may edit this if it reveals too much: had to revert to numpy for random dice throws as the standard random implementation in python is too unreliable ...
by Jochen_P
Tue Jan 29, 2019 7:01 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 084
Replies: 29
Views: 7972

Re: Problem 084

Yay! my code keeps insisting that "100024" is the modal string for two six-sided die :-D That's a tad bit frustrating .. Ah, and I implemented the rule to just accumulate the doubles except there are 3 of them, otherwise my result would be "101918" :shock: [edith says:] now that I ran it for a coupl...
by Jochen_P
Mon Jan 07, 2019 7:47 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 622
Replies: 5
Views: 1903

Re: Problem 622

Really interesting little problem (imho 15% is a bit low) In the mean time I know exactly what the maximum deck size for s(n) = 60 is, or any other amount of shuffles for that matter, (No, you can't shuffle this deck by hand or even forklift :D ) but the decks in between are still a mistery to me. Y...
by Jochen_P
Tue Dec 04, 2018 2:08 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 485
Replies: 8
Views: 1922

Re: Problem 485

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 :roll:
by Jochen_P
Tue Dec 04, 2018 1:34 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 485
Replies: 8
Views: 1922

Re: Problem 485

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 :mrgreen: (below 1 msec)

[edit] sure enough my final answer is still wrong! I hate this problem [/edit]
by Jochen_P
Tue Dec 04, 2018 12:09 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 485
Replies: 8
Views: 1922

Re: Problem 485

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 ...
by Jochen_P
Mon Dec 03, 2018 5:38 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 485
Replies: 8
Views: 1922

Re: Problem 485

I keep getting 16739 for S(1000,10), pretty fast but obviously wrong. This drives me mad :evil: I'm pretty sure my algo for S() should work though. Got the wrong result for the problems answer in about 126 seconds :mrgreen: Anyone keen to give a second pair of eyes on my python code, or experienced ...
by Jochen_P
Fri Nov 16, 2018 9:33 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 420
Replies: 11
Views: 4380

Re: Problem 420

Nope, sorry. Still don't get it. Seems that I'm a bit thick today :( [edit] The only thing I see there is that the ratios on the diagonals are the same in every matrix, but how that accounts for those lesser matrices to be squared? No clue[/edit] [edit 2] Animus was so kind to link me to the corresp...
by Jochen_P
Fri Nov 16, 2018 9:02 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 420
Replies: 11
Views: 4380

Re: Problem 420

I don't get this at all.. Can someone explain to me how these matrices relate to each other? The sum of those matrices are different and I just can't make out any other relation :oops: taking the sample: https://projecteuler.net/project/images/p420_matrix.gif Maybe I'm just a bit undercaffeinated?
by Jochen_P
Mon Oct 01, 2018 5:19 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 615
Replies: 3
Views: 1770

Re: Problem 615

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

Now to find out where and why the easy to spot pattern from the example values breaks :(
by Jochen_P
Thu Sep 20, 2018 8:43 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 615
Replies: 3
Views: 1770

Re: Problem 615

Can someone confirm the 1000th number with at least 5 Prime Factors to be 9576 ?
thank you :)
by Jochen_P
Tue Sep 11, 2018 7:33 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 321
Replies: 17
Views: 4617

Re: Problem 321

Got it ... very nice pattern, not easy to spot
by Jochen_P
Mon Sep 10, 2018 11:52 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 321
Replies: 17
Views: 4617

Re: Problem 321

stijn263 wrote:
Sun Jan 23, 2011 6:04 pm
Can you perhaps spot a pattern among those first 22 terms?

Have fun solving!
hmm ... pattern spotting ... 1,3,10,22,63,1nn,3nn :shock:
Nope, don't see any. Any hint?

Got the same results as others for 20(correct), 25(false) and 30(false)
by Jochen_P
Tue Apr 03, 2018 7:48 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 333
Replies: 11
Views: 3661

Re: Problem 333

... way too long to get even sum P(q)=1 for q<10**3.
4600 in a bit more than an hour m(

Can't think of any other good way to optimize that anymore, there are way too many partitions to check.
There has to be a simple rule/formula for excluding terms in this, but damn, do I suck at maths :mrgreen:
by Jochen_P
Wed Mar 28, 2018 7:09 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 333
Replies: 11
Views: 3661

Re: Problem 333

Aye, thanx a lot!

I kind of left them out by purpose.. thought once again incorrectly that a partition must consist of n>1 elements. m(
Now to make this bugger efficient. Runs way too long to get P(q)=1 for q<10**6
by Jochen_P
Wed Mar 28, 2018 6:24 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 333
Replies: 11
Views: 3661

Re: Problem 333

Resuming the problems after a long break. My terms for q <100 are [2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96] my result for P(q)=1 for q<100 is 228 (instead of 233) :shock: Has anybody any clue where I'm going wrong? My primes with P(q) = 1 are 5 7 13 17 23 43 59 61
by Jochen_P
Tue Feb 22, 2011 6:04 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 014
Replies: 60
Views: 13161

Re: Problem 014

Please remove the correct answer .. see above:

In particular don't post any code fragments or results

And well, starting with this number produces a chain with more elements than 237.. your code must have a glitch.
by Jochen_P
Mon Feb 21, 2011 10:38 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 017
Replies: 83
Views: 21728

Re: Problem 017

Yeah, please send it.. I am curious If I am able to spot the looney in an unfamiliar language.. (no guarantuee)