#getting upper bound of sum by computation?

9 messages · Page 1 of 1 (latest)

meager roostBOT
north cedar
#

this is an upper bound i think

#

but it is normally used for inequalities not for equations

#

well there is an average rate of change at that big numbers

#

not specifically 0.001

#

but like then you can compute the average rate of change, then compute the sum of the numbers and maybe like ×2

#

thats why i said maybe like

#

i dont know specifically how it works

glass nest
#

consider looking for upper bounds on 1/n^2 and using Euler-maclaurin formula, I don’t have any further ideas on this so I’d recommend you look into this