Search found 7 matches

by petersc
Wed Apr 02, 2014 2:35 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 049
Replies: 30
Views: 10513

Re: Problem 049

Okay, I see. I just approached it in a different manner. Thanks. And yes the difference for the correct sequence is indeed <4500.
by petersc
Wed Apr 02, 2014 1:18 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 049
Replies: 30
Views: 10513

Re: Problem 049

Why under 5000 for 4-digit sequence?
by petersc
Thu Mar 27, 2014 3:23 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 029
Replies: 18
Views: 6970

Re: Problem 029

I am thinking that as a increases, only values of a that are powers of another number will generate duplicates. Would this be a correct assumption? My solution produces matching results for the lower values of n posted in this thread, but I still do not get the correct answer for the problem.
by petersc
Tue Mar 18, 2014 12:59 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 092
Replies: 14
Views: 3560

Re: Problem 092

I cannot seem to get the correct answer to this problem. I think I'm using a pretty efficient and logical approach. How can I share this approach with those that have solved the problem in order to get some opinion or feedback as to what might be wrong with my thinking? Without posting spoiler info....
by petersc
Fri Jan 03, 2014 6:26 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 056
Replies: 12
Views: 3506

Re: Problem 056

Thank you both for your prompt responses.

Powers of 4: CHECK!
20^14: 22

But... alas...
45^67: 540 (Strangely a transposition of the same digits in Thundre's answer)
94^37: 350

I guess I've got some digging to do. :?

Thanks again.
by petersc
Fri Jan 03, 2014 2:43 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 056
Replies: 12
Views: 3506

Re: Problem 056

I am fairly confident in my algorithm, but am not getting the correct answer. Could someone knock the dust off of their old solution and maybe provide a few digital sums for large values of a and b for me to check my results against?

Thanks!
by petersc
Fri Feb 24, 2012 2:59 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 372
Replies: 7
Views: 2381

Re: Problem 372

I am having trouble understanding why my solution works for R(100,10000) and not for R(2000000,1000000000). I am using 64 bit unsigned long variables, which should accommodate 10^18 just fine, any hints?