Search Results for ""

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 ...

The converse of Fermat's little theorem is also known as Lehmer's theorem. It states that, if an integer x is prime to m and x^(m-1)=1 (mod m) and there is no integer e<m-1 ...

A line segment on the boundary of a face, also called a side.

The breaking up of self-intersecting polygons into simple polygons (illustrated above) is also called tessellation (Woo et al. 1999).

A distribution of values of a discrete variate represented graphically by plotting points (x_1,f_1), (x_2,f_2), ..., (x_k,f_k), and drawing a set of straight line segments ...

Circumscribe a triangle about a circle, another circle around the triangle, a square outside the circle, another circle outside the square, and so on. The circumradius and ...

Compass and straightedge geometric constructions dating back to Euclid were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, ...

The regular hexagon is the regular polygon with six sides, as illustrated above. The inradius r, circumradius R, sagitta s, and area A of a regular hexagon can be computed ...

The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...

The mean triangle area of a triangle picked inside a regular n-gon of unit area is A^__n=(9cos^2omega+52cosomega+44)/(36n^2sin^2omega), (1) where omega=2pi/n (Alikoski 1939; ...