Search Results for ""

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

Consider a function f(x) in one dimension. If f(x) has a relative extremum at x_0, then either f^'(x_0)=0 or f is not differentiable at x_0. Either the first or second ...

Let |sum_(n=1)^pa_n|<K, (1) where K is independent of p. Then if f_n>=f_(n+1)>0 and lim_(n->infty)f_n=0, (2) it follows that sum_(n=1)^inftya_nf_n (3) converges.

Let suma_k and sumb_k be a series with positive terms and suppose a_1<=b_1, a_2<=b_2, .... 1. If the bigger series converges, then the smaller series also converges. 2. If ...

The series sumf(n) for a monotonic nonincreasing f(x) is convergent if lim_(x->infty)^_(e^xf(e^x))/(f(x))<1 and divergent if lim_(x->infty)__(e^xf(e^x))/(f(x))>1.

Let sum_(n=1)^(infty)u_n(x) be a series of functions all defined for a set E of values of x. If there is a convergent series of constants sum_(n=1)^inftyM_n, such that ...

Suppose f(x) is continuous at a stationary point x_0. 1. If f^'(x)>0 on an open interval extending left from x_0 and f^'(x)<0 on an open interval extending right from x_0, ...

If u_n>0 and given B(n) a bounded function of n as n->infty, express the ratio of successive terms as |(u_n)/(u_(n+1))|=1+h/n+(B(n))/(n^r) for r>1. The series converges for ...

If, in an interval of x, sum_(r=1)^(n)a_r(x) is uniformly bounded with respect to n and x, and {v_r} is a sequence of positive non-increasing quantities tending to zero, then ...

Also known as the Leibniz criterion. An alternating series converges if a_1>=a_2>=... and lim_(k->infty)a_k=0.