Search Results for ""
21 - 30 of 35 for completedSearch Results
In 1611, Kepler proposed that close packing (either cubic or hexagonal close packing, both of which have maximum densities of pi/(3sqrt(2)) approx 74.048%) is the densest ...
RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...
The cycloid is the locus of a point on the rim of a circle of radius a rolling along a straight line. It was studied and named by Galileo in 1599. Galileo attempted to find ...
Let a chess piece make a tour on an n×n chessboard whose squares are numbered from 1 to n^2 along the path of the chess piece. Then the tour is called a magic tour if the ...
The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...
A quartic equation is a fourth-order polynomial equation of the form z^4+a_3z^3+a_2z^2+a_1z+a_0=0. (1) While some authors (Beyer 1987b, p. 34) use the term "biquadratic ...
The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...
The Taniyama-Shimura conjecture, since its proof now sometimes known as the modularity theorem, is very general and important conjecture (and now theorem) connecting topology ...
A p-adic number is an extension of the field of rationals such that congruences modulo powers of a fixed prime p are related to proximity in the so called "p-adic metric." ...
Kontsevich's integral is a far-reaching generalization of the Gauss integral for the linking number, and provides a tool to construct the universal Vassiliev invariant of a ...
...
View search results from all Wolfram sites (2807 matches)

