Search Results for ""

Let u_k be a series with positive terms and suppose rho=lim_(k->infty)(u_(k+1))/(u_k). Then 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series diverges. ...

If alpha is any number and m and n are integers, then there is a rational number m/n for which |alpha-m/n|<=1/n. (1) If alpha is irrational and k is any whole number, there ...

It is possible to find six points in the plane, no three on a line and no four on a circle (i.e., none of which are collinear or concyclic), such that all the mutual ...

Rational numbers are countable, so an order can be placed on them just like the natural numbers. Although such an ordering is not obvious (nor unique), one such ordering can ...

Somos defines a rational triangle as a triangle such that all three sides measured relative to each other are rational. Koblitz (1993) defined a congruent number as an ...

A technique for computing eigenfunctions and eigenvalues. It proceeds by requiring J=int_a^b[p(x)y_x^2-q(x)y^2]dx (1) to have a stationary value subject to the normalization ...

y^('')-mu(1-1/3y^('2))y^'+y=0, where mu>0. Differentiating and setting y=y^' gives the van der Pol equation. The equation y^('')-mu(1-y^('2))y^'+y=0 with the 1/3 replaced by ...

The distribution with probability density function and distribution function P(r) = (re^(-r^2/(2s^2)))/(s^2) (1) D(r) = 1-e^(-r^2/(2s^2)) (2) for r in [0,infty) and parameter ...

The Rayleigh functions sigma_n(nu) for n=1, 2, ..., are defined as sigma_n(nu)=sum_(k=1)^inftyj_(nu,k)^(-2n), where +/-j_(nu,k) are the zeros of the Bessel function of the ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...