TOPICS
Search

Search Results for ""


571 - 580 of 729 for modular sieve methodSearch Results
A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...
A technical mathematical object defined in terms of a polynomial ring of n variables over a field k. Syzygies occur in tensors at rank 5, 7, 8, and all higher ranks, and play ...
Given a regular tetrahedron of unit volume, consider the lengths of line segments connecting pairs of points picked at random inside the tetrahedron. The distribution of ...
The game of billiards is played on a rectangular table (known as a billiard table) upon which balls are placed. One ball (the "cue ball") is then struck with the end of a ...
Count the number of lattice points N(r) inside the boundary of a circle of radius r with center at the origin. The exact solution is given by the sum N(r) = ...
A polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. A polynomial in one variable (i.e., a univariate ...
If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...
In antiquity, geometric constructions of figures and lengths were restricted to the use of only a straightedge and compass (or in Plato's case, a compass only; a technique ...
An n-mark Golomb ruler is a set of n distinct nonnegative integers (a_1,a_2,...,a_n), called "marks," such that the positive differences |a_i-a_j|, computed over all possible ...
A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...
1 ... 55|56|57|58|59|60|61 ... 73 Previous Next

...