Page 1 of 1
Problem 304
Posted: Wed Oct 06, 2010 9:53 am
by politicalconfusion
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?
Re: Problem 304
Posted: Wed Oct 06, 2010 12:14 pm
by Lord_Farin
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.
Re: Problem 304
Posted: Sun Jan 09, 2011 4:16 pm
by cjqcjq
so, what's the result of ∑b(n) is for 1≤n≤100 or 1≤n≤1000?
Re: Problem 304
Posted: Mon Jan 30, 2012 12:09 pm
by rockstome
b(1)=428,562,224,098 mod 1234567891011
is it correct?
Re: Problem 304
Posted: Mon Jan 30, 2012 3:23 pm
by ldesnogu
Yes.
Re: Problem 304
Posted: Mon Jan 30, 2012 4:13 pm
by rockstome
∑b(n) for 1≤n≤1000 in 0.25 second
∑b(n) for 1≤n≤10000 in 48 second
my algo is really stupid
