What is the sum of 2, 4, 16, 256, 65535, ..
kasu...@gmail.com
Could you tell me how I can solve this problem?
Valeri Astanoff
> I want to find the sum of 2, 4, 16, 256, 65535, ..
> Could you tell me how I can solve this problem?
Good day,
Here is an approximate formula:
s(n) = 38*n^3 - 222*n^2 + 404*n + 2^(2^n) - 218
V.Astanoff
JEMebius
> I want to find the sum of 2, 4, 16, 256, 65535, ..
> Could you tell me how I can solve this problem?
Just by elementary-school arithmetic and by securing exponentially increasing quantities
of pencil, paper and eraser as you proceed towards infinity.
Happy studies: Johan E. Mebius
The Qurqirish Dragon
> I want to find the sum of 2, 4, 16, 256, 65535, ..
> Could you tell me how I can solve this problem?
The general term is apparently 2^(2^n), n=0,1,2,... so, since each
term is exponentially greater than the previous one, the sequence of
partial sums is asymptotic to the final term in the partial sum.
(asymptotic in the sense that the ratio of the last term to the
partial sum becomes arbitrarily close to 1). Obviously the full series
diverges and has no sum.
Details are left as an exercise to the OP.
Neilist
> Could you tell me how I can solve this problem?
YOUR problem is in typing and proofreading, and you can solve your
problem by reading what you type, and by typing more slowly BEFORE you
press SEND.
Your last term should be 65536 = 2^16, in order for the terms of your
sequence to be 2^(2^i) for i=0 to infinity.
Richard Tobin
Neilist <latto...@gmail.com> wrote:
>> I want to find the sum of 2, 4, 16, 256, 65535, ..
>> Could you tell me how I can solve this problem?
>YOUR problem is in typing and proofreading, and you can solve your
>problem by reading what you type, and by typing more slowly BEFORE you
>press SEND.
I think you're the one with the problem here.
-- Richard
--
:wq
Neilist
> In article <c195b541-8182-4b38-9b73-6a0e58136...@n58g2000hsf.googlegroups.com>,
>
> Neilist <lattora...@gmail.com> wrote:
> >> I want to find the sum of 2, 4, 16, 256, 65535, ..
> >> Could you tell me how I can solve this problem?
> >YOUR problem is in typing and proofreading, and you can solve your
> >problem by reading what you type, and by typing more slowly BEFORE you
> >press SEND.
>
> I think you're the one with the problem here.
>
> -- Richard
> --
> :wq
I think you're the one with the problem here. Right back at you.
[Mr.] Lynn Kurtz
wrote:
I don't think so. First question is whether the OP means 65536 instead
of 65535. And if so, see:
http://www.research.att.com/~njas/sequences/A001146
--Lynn
tommy1729
no its you neilist.
tommy1729
> On Feb 22, 7:07 am, kasum...@gmail.com wrote:
> > I want to find the sum of 2, 4, 16, 256, 65535, ..
> > Could you tell me how I can solve this problem?
>
> The general term is apparently 2^(2^n), n=0,1,2,...
> so, since each
> term is exponentially greater than the previous one,
> the sequence of
> partial sums is asymptotic to the final term in the
> partial sum.
> (asymptotic in the sense that the ratio of the last
> term to the
> partial sum becomes arbitrarily close to 1).
trivial.
> Obviously the full series
> diverges and has no sum.
perhaps the OP wonders about a summability method.
>
> Details are left as an exercise to the OP.
what details ?? what exercise ??
regards
tommy1729
Neilist
>
> - Show quoted text -
Tommy1729 still hasn't resolved his mental problems regarding
integrals.
On August 28, 2007, 2:35 PM, Tommy1729 wrote:
"integers ...-2,-1,0,1,2,...
integrals 1,2,3,4,...
natural numbers 0,1,2,3,... "
Hahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahaha!
Hey Tommy, here's an "integral" for you: 69
Hahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahaha!
191019...@gmail.com
> I want to find the sum of 2, 4, 16, 256, 65535, ..
> Could you tell me how I can solve this problem?
Basil Jet
--
Basil Jet recently enjoyed listening to
The Box - 1983 - The Box