Problem 304

politicalconfusion · Post by **politicalconfusion** » Wed Oct 06, 2010 9:53 am

Is it OK to ask for what ∑b(n) is for 1≤n≤100 or 1≤n≤1000? I tried this one from scratch twice and I can't see where I'm off.

Also, does fib(10^14) have trillions of digits?

Lord_Farin · Post by **Lord_Farin** » Wed Oct 06, 2010 12:14 pm

As for the first question, I would argue that asking is okay, but giving the results might not be.
For the second question, the answer is yes. The number would consume over 8TB of computer memory. That should tell you why the modulo answer is requested.

cjqcjq · Post by **cjqcjq** » Sun Jan 09, 2011 4:16 pm

so, what's the result of ∑b(n) is for 1≤n≤100 or 1≤n≤1000?

rockstome · Post by **rockstome** » Mon Jan 30, 2012 12:09 pm

b(1)=428,562,224,098 mod 1234567891011
is it correct?

ldesnogu · Post by **ldesnogu** » Mon Jan 30, 2012 3:23 pm

rockstome · Post by **rockstome** » Mon Jan 30, 2012 4:13 pm

∑b(n) for 1≤n≤1000 in 0.25 second
∑b(n) for 1≤n≤10000 in 48 second
my algo is really stupid

Project Euler Forum

Problem 304

Problem 304

Re: Problem 304

Re: Problem 304

Re: Problem 304

Re: Problem 304

Re: Problem 304