Search Results for ""

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...

A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...

A circular embedding is a graph embedding in which all graph vertices lie on a common circle, usually arranged so they are equally spaced around the circumference. Specific ...

The functions describing the horizontal and vertical positions of a point on a circle as a function of angle (cosine and sine) and those functions derived from them: cotx = ...

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

y=x(dy)/(dx)+f((dy)/(dx)) (1) or y=px+f(p), (2) where f is a function of one variable and p=dy/dx. The general solution is y=cx+f(c). (3) The singular solution envelopes are ...

Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...

Let O be an order of an imaginary quadratic field. The class equation of O is the equation H_O=0, where H_O is the extension field minimal polynomial of j(O) over Q, with ...

Clausen's _4F_3 identity _4F_3(a,b,c,d; e,f,g;1)=((2a)_(|d|)(a+b)_(|d|)(2b)_(|d|))/((2a+2b)_(|d|)a_(|d|)b_(|d|)), (1) holds for a+b+c-d=1/2, e=a+b+1/2, a+f=d+1=b+g, where d a ...

The downward Clenshaw recurrence formula evaluates a sum of products of indexed coefficients by functions which obey a recurrence relation. If f(x)=sum_(k=0)^Nc_kF_k(x) (1) ...