TOPICS
Search

Search Results for ""


111 - 120 of 1033 for Largest small octagonSearch Results
An addition-multiplication square is a square of integers that is simultaneously a magic square and multiplication magic square. In 1955, Horner found a square of order eight ...
A closed curve associated with a knot which is displaced along the normal by a small amount. For a knot K parameterized as x^mu(s) for 0<=s<=L along the length of the knot by ...
Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...
A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.
The Frobenius equation is the Diophantine equation a_1x_1+a_2x_2+...+a_nx_n=b, where the a_i are positive integers, b is an integer, and the solutions x_i are nonnegative ...
The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...
An algebraic structure whose elements consist of selected homeomorphisms between open subsets of a space, with the composition of two transformations defined on the largest ...
The polyhedron compound of the great icosahedron (U_(53)) and the small stellated dodecahedron (U_(34)), sometimes known as the great cid. Four faces meet at each edge of the ...
The simple continued fraction of the Golomb-Dickman constant lambda is [0; 1, 1, 1, 1, 1, 22, 1, 2, 3, 1, 1, 11, ...] (OEIS A225336). Note that this continued fraction ...
The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...
1 ... 9|10|11|12|13|14|15 ... 104 Previous Next

...