TOPICS
Search

Search Results for ""


601 - 610 of 2089 for Eulers Polygon Division ProblemSearch Results
An Euler-Jacobi pseudoprime to a base a is an odd composite number n such that (a,n)=1 and the Jacobi symbol (a/n) satisfies (a/n)=a^((n-1)/2) (mod n) (Guy 1994; but note ...
A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...
A regular pyramid is a right pyramid whose base is a regular polygon. For a right pyramid of height h with a regular n-gonal base of side length a and circumradius R, the ...
A one-person game played on a rectangular lattice of lamps which can be turned on and off. A move consists of flipping a "switch" inside one of the squares, thereby toggling ...
The proposal originally made by Georg Cantor that there is no infinite set with a cardinal number between that of the "small" infinite set of integers aleph_0 and the "large" ...
A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...
The points of intersection of the adjacent angle trisectors of the angles of any triangle DeltaABC are the polygon vertices of an equilateral triangle DeltaDEF known as the ...
For a finite group G, let p(G) be the subgroup generated by all the Sylow p-subgroups of G. If X is a projective curve in characteristic p>0, and if x_0, ..., x_t are points ...
A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...
A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if 1. It is a one-way hash function. 2. It is hard ...
1 ... 58|59|60|61|62|63|64 ... 209 Previous Next

...