Search Results for ""

The intersection of an ellipse centered at the origin and semiaxes of lengths a and b oriented along the Cartesian axes with a line passing through the origin and point ...

The involute of an ellipse specified parametrically by x = acost (1) y = bsint (2) is given by the parametric equations x_i = ...

A generalization of the helicoid to the parametric equations x(u,v) = avcosu (1) y(u,v) = bvsinu (2) z(u,v) = cu. (3) In this parametrization, the surface has first ...

The second singular value k_2, corresponding to K^'(k_2)=sqrt(2)K(k_2), (1) is given by k_2 = tan(pi/8) (2) = sqrt(2)-1 (3) k_2^' = sqrt(2)(sqrt(2)-1). (4) For this modulus, ...

Given a spheroid with equatorial radius a and polar radius c, the ellipticity is defined by e={sqrt((a^2-c^2)/(a^2)) c<a (oblate spheroid); sqrt((c^2-a^2)/(c^2)) c>a (prolate ...

A 1-cusped epicycloid has b=a, so n=1. The radius measured from the center of the large circle for a 1-cusped epicycloid is given by epicycloid equation (◇) with n=1 so r^2 = ...

A function which arises in the fractional integral of e^(at), given by E_t(nu,a) = (e^(at))/(Gamma(nu))int_0^tx^(nu-1)e^(-ax)dx (1) = (a^(-nu)e^(at)gamma(nu,at))/(Gamma(nu)), ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

If P(x,y) and P(x^',y^') are two points on an ellipse (x^2)/(a^2)+(y^2)/(b^2)=1, (1) with eccentric angles phi and phi^' such that tanphitanphi^'=b/a (2) and A=P(a,0) and ...