Search Results for ""

A problem in the calculus of variations. Let a vessel traveling at constant speed c navigate on a body of water having surface velocity u = u(x,y) (1) v = v(x,y). (2) The ...

An arrangement of n>=3 points such that n-1 of them are collinear.

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...

Call a number of the form n^2-k a "near-square number." Numbers of the form n^2-5 for n=1, 2, ... are -4, -1, 4, 11, 20, 31, 44, 59, 76, 95, ... (OEIS A028875). These are ...

A near noble number is a real number 0<nu<1 whose continued fraction is periodic, and the periodic sequence of terms is composed of a string of p-1 1s followed by an integer ...

Every irrational number x can be expanded in a unique continued fraction expansion x=b_0+(e_1)/(b_1+(e_2)/(b_2+(e_3)/(b_3+...)))=[b_0;e_1b_1,e_2b_2,e_3b_3,...] such that b_0 ...

The nearest integer function, also called nint or the round function, is defined such that nint(x) is the integer closest to x. While the notation |_x] is sometimes used to ...

The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...

The primes nearest to the nonnegative integers n=0, 1, 2, ..., assigning ties to the smaller prime, are 2, 2, 2, 3, 3, 5, 5, 7, 7, 7, 11, 11, 11, 13, ... (OEIS A051697). If ...

Let generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] (1) have p=q+1. Then the generalized hypergeometric function is said to ...