Search Results for ""
4411 - 4420 of 4827 for Eight Point Circle TheoremSearch Results
An amazing pandigital approximation to e that is correct to 18457734525360901453873570 decimal digits is given by (1+9^(-4^(7·6)))^(3^(2^(85))), (1) found by R. Sabey in 2004 ...
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...
A 4-cusped hypocycloid which is sometimes also called a tetracuspid, cubocycloid, or paracycle. The parametric equations of the astroid can be obtained by plugging in n=a/b=4 ...
A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...
Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...
Let there be n>=2 integers 0<a_1<...<a_n with GCD(a_1,a_2,...,a_n)=1. The values a_i represent the denominations of n different coins, where these denominations have greatest ...
The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].
The Dedekind eta function is defined over the upper half-plane H={tau:I[tau]>0} by eta(tau) = q^_^(1/24)(q^_)_infty (1) = q^_^(1/24)product_(k=1)^(infty)(1-q^_^k) (2) = ...
Dürer's solid, also known as the truncated triangular trapezohedron, is the 8-faced solid depicted in an engraving entitled Melencolia I by Albrecht Dürer (The British ...
The simplest class of one-dimensional cellular automata. Elementary cellular automata have two possible values for each cell (0 or 1), and rules that depend only on nearest ...
...
View search results from all Wolfram sites (35522 matches)

