Search Results for ""

In geometry, the term "enlargement" is a synonym for expansion. In nonstandard analysis, let X be a set of urelements, and let V(X) be the superstructure with individuals in ...

Given a system of ordinary differential equations of the form d/(dt)[x; y; v_x; v_y]=-[0 0 -1 0; 0 0 0 -1; Phi_(xx)(t) Phi_(yx)(t) 0 0; Phi_(xy)(t) Phi_(yy)(t) 0 0][x; y; ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

A non-Euclidean geometry, also called Lobachevsky-Bolyai-Gauss geometry, having constant sectional curvature -1. This geometry satisfies all of Euclid's postulates except the ...

The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...

The metric dimension beta(G) (Tillquist et al. 2021) or dim(G) (Tomescu and Javid 2007, Ali et al. 2016) of a graph G is the smallest number of nodes required to identify all ...

A set of four points, one of which is the orthocenter of the other three. In an orthocentric system, each point is the orthocenter of the triangle of the other three, as ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

A closed planar quadrilateral with opposite sides of equal lengths a and b, and with four right angles. A square is a degenerate rectangle with a=b. The area of the rectangle ...