Search Results for ""
2301 - 2310 of 3209 for Subset sum problemSearch Results
The dimension of an object is a topological measure of the size of its covering properties. Roughly speaking, it is the number of coordinates needed to specify a point on the ...
A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...
The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...
A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...
The digits in the number 2187 form the two vampire numbers: 21×87=1827 and 2187=27×81. 2187 is also given by 3^7.
A theorem which asserts that if a sequence or function behaves regularly, then some average of it behaves regularly. For example, A(x)∼x implies A_1(x)=int_0^xA(t)dt∼1/2x^2 ...
A convex body in Euclidean space that is centrally symmetric with center at the origin is determined among all such bodies by its brightness function (the volume of each ...
The algebraics, sometimes denoted A (Derbyshire 2004, p. 173), are the set of algebraic numbers. The set of algebraic numbers is implemented in the Wolfram Language as ...
1. A fixed polyomino. 2. The set of points obtained by taking the centers of a fixed polyomino.
If the total group of the canonical series is divided into two parts, the difference between the number of points in each part and the double of the dimension of the complete ...
...
View search results from all Wolfram sites (180219 matches)

