Search Results for ""
511 - 520 of 1395 for order costSearch Results

For an ellipse with parametric equations x = acost (1) y = bsint, (2) the negative pedal curve with respect to the origin has parametric equations x_n = ...
The parallel curves for (outward) offset k of an ellipse with semi-axis lengths a and b are given by x_p = (a+(bk)/(sqrt(a^2sin^2t+b^2cos^2t)))cost (1) y_p = ...
A hypotrochoid is a roulette traced by a point P attached to a circle of radius b rolling around the inside of a fixed circle of radius a, where P is a distance h from the ...
A curve investigated by Talbot which is the ellipse negative pedal curve with respect to the ellipse's center for ellipses with eccentricity e^2>1/2 (Lockwood 1967, p. 157). ...
A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...
The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...
The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...
For any ideal I in a Dedekind ring, there is an ideal I_i such that II_i=z, (1) where z is a principal ideal, (i.e., an ideal of rank 1). Moreover, for a Dedekind ring with a ...
A class of complete orientable minimal surfaces of R^3 derived from Enneper's minimal surface. They are named for the mathematicians who found the first two examples in 1982. ...
Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

...