Search Results for ""
201 - 210 of 391 for Amicable PairSearch Results
A tetradic (or four-way) number is a number that remains unchanged when flipped back to front, mirrored up-down, or flipped up-down. Since the only numbers that remain ...
The contraction of a pair of vertices v_i and v_j of a graph, also called vertex identification, is the operation that produces a graph in which the two nodes v_1 and v_2 are ...
A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...
The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...
1729 is sometimes called the Hardy-Ramanujan number. It is the smallest taxicab number, i.e., the smallest number which can be expressed as the sum of two cubes in two ...
The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...
A pair of identical plane regions (mirror symmetric about two perpendicular lines through the center) which can be stitched together to form a baseball (or tennis ball). A ...
The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...
The so-called generalized Fourier integral is a pair of integrals--a "lower Fourier integral" and an "upper Fourier integral"--which allow certain complex-valued functions f ...
Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...
...
View search results from all Wolfram sites (4042 matches)

