Search Results for ""

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 Stammler circle is the circumcircle of the Stammler triangle. Unexpectedly, it has center at the circumcenter O (X_3) of the reference triangle and radius 2R (Ehrmann and ...

A modified Miller's primality test which gives a guarantee of primality or compositeness. The algorithm's running time for a number n has been proved to be as ...

The term "similarity transformation" is used either to refer to a geometric similarity, or to a matrix transformation that results in a similarity. A similarity ...

If isosceles triangles with apex angles 2kpi/n are erected on the sides of an arbitrary n-gon A_0, and if this process is repeated with the n-gon A_1 formed by the free ...

Nice approximations for the golden ratio phi are given by phi approx sqrt((5pi)/6) (1) approx (7pi)/(5e), (2) the last of which is due to W. van Doorn (pers. comm., Jul. 18, ...

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

Draw antiparallels through the symmedian point K. The points where these lines intersect the sides then lie on a circle, known as the cosine circle (or sometimes the second ...