Search Results for ""

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...

The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...

If two perpendicular lines are drawn through the orthocenter H of any triangle, these lines intercept each side (or its extension) in two points (labeled P_(12), P_(12)^', ...

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

The first few values of product_(k=1)^(n)k! (known as a superfactorial) for n=1, 2, ... are given by 1, 2, 12, 288, 34560, 24883200, ... (OEIS A000178). The first few ...

A curious approximation to the Feigenbaum constant delta is given by pi+tan^(-1)(e^pi)=4.669201932..., (1) where e^pi is Gelfond's constant, which is good to 6 digits to the ...

The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...

The conjecture that there are only finitely many triples of relatively prime integer powers x^p, y^q, z^r for which x^p+y^q=z^r (1) with 1/p+1/q+1/r<1. (2) Darmon and Merel ...

In 1638, Fermat proposed that every positive integer is a sum of at most three triangular numbers, four square numbers, five pentagonal numbers, and n n-polygonal numbers. ...