1.
Regular polygon
–
In Euclidean geometry, a regular polygon is a polygon that is equiangular and equilateral. Regular polygons may be convex or star, in the limit, a sequence of regular polygons with an increasing number of sides becomes a circle, if the perimeter is fixed, or a regular apeirogon, if the edge length is fixed. These properties apply to all regular polygons, whether convex or star, a regular n-sided polygon has rotational symmetry of order n. All vertices of a regular polygon lie on a common circle and that is, a regular polygon is a cyclic polygon. Together with the property of equal-length sides, this implies that every regular polygon also has a circle or incircle that is tangent to every side at the midpoint. Thus a regular polygon is a tangential polygon, a regular n-sided polygon can be constructed with compass and straightedge if and only if the odd prime factors of n are distinct Fermat primes. The symmetry group of a regular polygon is dihedral group Dn, D2, D3. It consists of the rotations in Cn, together with reflection symmetry in n axes that pass through the center, if n is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite sides. If n is odd then all pass through a vertex. All regular simple polygons are convex and those having the same number of sides are also similar. An n-sided convex regular polygon is denoted by its Schläfli symbol, for n <3 we have two degenerate cases, Monogon, degenerate in ordinary space. Digon, a line segment, degenerate in ordinary space. In certain contexts all the polygons considered will be regular, in such circumstances it is customary to drop the prefix regular. For instance, all the faces of uniform polyhedra must be regular, for n >2 the number of diagonals is n 2, i. e.0,2,5,9. for a triangle, square, pentagon, hexagon. The diagonals divide the polygon into 1,4,11,24, for a regular n-gon inscribed in a unit-radius circle, the product of the distances from a given vertex to all other vertices equals n. For a regular simple n-gon with circumradius R and distances di from a point in the plane to the vertices. For a regular n-gon, the sum of the distances from any interior point to the n sides is n times the apothem. This is a generalization of Vivianis theorem for the n=3 case, the sum of the perpendiculars from a regular n-gons vertices to any line tangent to the circumcircle equals n times the circumradius
2.
Edge (geometry)
–
For edge in graph theory, see Edge In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a segment on the boundary. In a polyhedron or more generally a polytope, an edge is a segment where two faces meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. In graph theory, an edge is an abstract object connecting two vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its skeleton or edge-skeleton, conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by Steinitzs theorem as being exactly the 3-vertex-connected planar graphs. Any convex polyhedrons surface has Euler characteristic V − E + F =2, where V is the number of vertices, E is the number of edges and this equation is known as Eulers polyhedron formula. Thus the number of edges is 2 less than the sum of the numbers of vertices and faces, for example, a cube has 8 vertices and 6 faces, and hence 12 edges. In a polygon, two edges meet at each vertex, more generally, by Balinskis theorem, at least d edges meet at every vertex of a convex polytope. Similarly, in a polyhedron, exactly two faces meet at every edge, while in higher dimensional polytopes three or more two-dimensional faces meet at every edge. Thus, the edges of a polygon are its facets, the edges of a 3-dimensional convex polyhedron are its ridges, archived from the original on 4 February 2007
3.
Vertex (geometry)
–
In geometry, a vertex is a point where two or more curves, lines, or edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedra are vertices. A vertex is a point of a polygon, polyhedron, or other higher-dimensional polytope. However, in theory, vertices may have fewer than two incident edges, which is usually not allowed for geometric vertices. However, a smooth approximation to a polygon will also have additional vertices. A polygon vertex xi of a simple polygon P is a principal polygon vertex if the diagonal intersects the boundary of P only at x and x, there are two types of principal vertices, ears and mouths. A principal vertex xi of a simple polygon P is called an ear if the diagonal that bridges xi lies entirely in P, according to the two ears theorem, every simple polygon has at least two ears. A principal vertex xi of a simple polygon P is called a mouth if the diagonal lies outside the boundary of P. Any convex polyhedrons surface has Euler characteristic V − E + F =2, where V is the number of vertices, E is the number of edges and this equation is known as Eulers polyhedron formula. Thus the number of vertices is 2 more than the excess of the number of edges over the number of faces, for example, a cube has 12 edges and 6 faces, and hence 8 vertices
4.
Dihedral group
–
In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of groups, and they play an important role in group theory, geometry. The notation for the group of order n differs in geometry. In geometry, Dn or Dihn refers to the symmetries of the n-gon, in abstract algebra, Dn refers to the dihedral group of order n. The geometric convention is used in this article, a regular polygon with n sides has 2 n different symmetries, n rotational symmetries and n reflection symmetries. Usually, we take n ≥3 here. The associated rotations and reflections make up the dihedral group D n, if n is odd, each axis of symmetry connects the midpoint of one side to the opposite vertex. If n is even, there are n/2 axes of symmetry connecting the midpoints of opposite sides, in either case, there are n axes of symmetry and 2 n elements in the symmetry group. Reflecting in one axis of symmetry followed by reflecting in another axis of symmetry produces a rotation through twice the angle between the axes, as with any geometric object, the composition of two symmetries of a regular polygon is again a symmetry of this object. With composition of symmetries to produce another as the binary operation, the following Cayley table shows the effect of composition in the group D3. R0 denotes the identity, r1 and r2 denote counterclockwise rotations by 120° and 240° respectively, for example, s2s1 = r1, because the reflection s1 followed by the reflection s2 results in a rotation of 120°. The order of elements denoting the composition is right to left, the composition operation is not commutative. In all cases, addition and subtraction of subscripts are to be performed using modular arithmetic with modulus n, if we center the regular polygon at the origin, then elements of the dihedral group act as linear transformations of the plane. This lets us represent elements of Dn as matrices, with composition being matrix multiplication and this is an example of a group representation. For example, the elements of the group D4 can be represented by the eight matrices. In general, the matrices for elements of Dn have the following form, rk is a rotation matrix, expressing a counterclockwise rotation through an angle of 2πk/n. Sk is a reflection across a line makes an angle of πk/n with the x-axis. Further equivalent definitions of Dn are, D1 is isomorphic to Z2, D2 is isomorphic to K4, the Klein four-group. D1 and D2 are exceptional in that, D1 and D2 are the only abelian dihedral groups, Dn is a subgroup of the symmetric group Sn for n ≥3
5.
Internal and external angles
–
In geometry, an angle of a polygon is formed by two sides of the polygon that share an endpoint. For a simple polygon, regardless of whether it is convex or non-convex, a polygon has exactly one internal angle per vertex. If every internal angle of a polygon is less than 180°. In contrast, an angle is an angle formed by one side of a simple polygon. The sum of the angle and the external angle on the same vertex is 180°. The sum of all the angles of a simple polygon is 180° where n is the number of sides. The formula can be proved using induction and starting with a triangle for which the angle sum is 180°. The sum of the angles of any simple convex or non-convex polygon is 360°. The interior angle concept can be extended in a consistent way to crossed polygons such as star polygons by using the concept of directed angles, in other words, 360k° represents the sum of all the exterior angles. For example, for convex and concave polygons k =1, since the exterior angle sum is 360°
6.
Degree (angle)
–
A degree, usually denoted by °, is a measurement of a plane angle, defined so that a full rotation is 360 degrees. It is not an SI unit, as the SI unit of measure is the radian. Because a full rotation equals 2π radians, one degree is equivalent to π/180 radians, the original motivation for choosing the degree as a unit of rotations and angles is unknown. One theory states that it is related to the fact that 360 is approximately the number of days in a year. Ancient astronomers noticed that the sun, which follows through the path over the course of the year. Some ancient calendars, such as the Persian calendar, used 360 days for a year, the use of a calendar with 360 days may be related to the use of sexagesimal numbers. The earliest trigonometry, used by the Babylonian astronomers and their Greek successors, was based on chords of a circle, a chord of length equal to the radius made a natural base quantity. One sixtieth of this, using their standard sexagesimal divisions, was a degree, Aristarchus of Samos and Hipparchus seem to have been among the first Greek scientists to exploit Babylonian astronomical knowledge and techniques systematically. Timocharis, Aristarchus, Aristillus, Archimedes, and Hipparchus were the first Greeks known to divide the circle in 360 degrees of 60 arc minutes, eratosthenes used a simpler sexagesimal system dividing a circle into 60 parts. Furthermore, it is divisible by every number from 1 to 10 except 7 and this property has many useful applications, such as dividing the world into 24 time zones, each of which is nominally 15° of longitude, to correlate with the established 24-hour day convention. Finally, it may be the case more than one of these factors has come into play. For many practical purposes, a degree is a small enough angle that whole degrees provide sufficient precision. When this is not the case, as in astronomy or for geographic coordinates, degree measurements may be written using decimal degrees, with the symbol behind the decimals. Alternatively, the sexagesimal unit subdivisions can be used. One degree is divided into 60 minutes, and one minute into 60 seconds, use of degrees-minutes-seconds is also called DMS notation. These subdivisions, also called the arcminute and arcsecond, are represented by a single and double prime. For example,40. 1875° = 40° 11′ 15″, or, using quotation mark characters, additional precision can be provided using decimals for the arcseconds component. The older system of thirds, fourths, etc. which continues the sexagesimal unit subdivision, was used by al-Kashi and other ancient astronomers, but is rarely used today
7.
Dual polygon
–
In geometry, polygons are associated into pairs called duals, where the vertices of one correspond to the edges of the other. The dual of a polygon is an isotoxal polygon. For example, the rectangle and rhombus are duals, in a cyclic polygon, longer sides correspond to larger exterior angles in the dual, and shorter sides to smaller angles. Further, congruent sides in the original polygon yields congruent angles in the dual, for example, the dual of a highly acute isosceles triangle is an obtuse isosceles triangle. In the Dorman Luke construction, each face of a polyhedron is the dual polygon of the corresponding vertex figure. As an example of the duality of polygons we compare properties of the cyclic. This duality is perhaps more clear when comparing an isosceles trapezoid to a kite. The simplest qualitative construction of a polygon is a rectification operation. New edges are formed between these new vertices and that is, the polygon generated by applying it twice is in general not similar to the original polygon. As with dual polyhedra, one can take a circle and perform polar reciprocation in it. Combinatorially, one can define a polygon as a set of vertices, a set of edges, then the dual polygon is obtained by simply switching the vertices and edges. Thus for the triangle with vertices and edges, the triangle has vertices, and edges, where B connects AB & BC. This is not a particularly fruitful avenue, as combinatorially, there is a family of polygons, geometric duality of polygons is more varied. Dual curve Dual polyhedron Self-dual polygon Dual Polygon Applet by Don Hatch
8.
Convex polygon
–
A convex polygon is a simple polygon in which no line segment between two points on the boundary ever goes outside the polygon. Equivalently, it is a polygon whose interior is a convex set. In a convex polygon, all angles are less than or equal to 180 degrees. A simple polygon which is not convex is called concave, the following properties of a simple polygon are all equivalent to convexity, Every internal angle is less than or equal to 180 degrees. Every point on line segment between two points inside or on the boundary of the polygon remains inside or on the boundary. The polygon is contained in a closed half-plane defined by each of its edges. For each edge, the points are all on the same side of the line that the edge defines. The angle at each vertex contains all vertices in its edges. The polygon is the hull of its edges. Additional properties of convex polygons include, The intersection of two convex polygons is a convex polygon, a convex polygon may br triangulated in linear time through a fan triangulation, consisting in adding diagonals from one vertex to all other vertices. Hellys theorem, For every collection of at least three convex polygons, if the intersection of three of them is nonempty, then the whole collection has a nonempty intersection. Krein–Milman theorem, A convex polygon is the hull of its vertices. Thus it is defined by the set of its vertices. Hyperplane separation theorem, Any two convex polygons with no points in common have a separator line, if the polygons are closed and at least one of them is compact, then there are even two parallel separator lines. Inscribed triangle property, Of all triangles contained in a convex polygon, inscribing triangle property, every convex polygon with area A can be inscribed in a triangle of area at most equal to 2A. Equality holds for a parallelogram.5 × Area ≤ Area ≤2 × Area, the mean width of a convex polygon is equal to its perimeter divided by pi. So its width is the diameter of a circle with the perimeter as the polygon. Every polygon inscribed in a circle, if not self-intersecting, is convex, however, not every convex polygon can be inscribed in a circle
9.
Circumscribed circle
–
In geometry, the circumscribed circle or circumcircle of a polygon is a circle which passes through all the vertices of the polygon. The center of circle is called the circumcenter and its radius is called the circumradius. A polygon which has a circle is called a cyclic polygon. All regular simple polygons, all isosceles trapezoids, all triangles, a related notion is the one of a minimum bounding circle, which is the smallest circle that completely contains the polygon within it. All triangles are cyclic, i. e. every triangle has a circumscribed circle and this can be proven on the grounds that the general equation for a circle with center and radius r in the Cartesian coordinate system is 2 +2 = r 2. Since this equation has three parameters only three points coordinate pairs are required to determine the equation of a circle, since a triangle is defined by its three vertices, and exactly three points are required to determine a circle, every triangle can be circumscribed. The circumcenter of a triangle can be constructed by drawing any two of the three perpendicular bisectors, the center is the point where the perpendicular bisectors intersect, and the radius is the length to any of the three vertices. This is because the circumcenter is equidistant from any pair of the triangles vertices, in coastal navigation, a triangles circumcircle is sometimes used as a way of obtaining a position line using a sextant when no compass is available. The horizontal angle between two landmarks defines the circumcircle upon which the observer lies, in the Euclidean plane, it is possible to give explicitly an equation of the circumcircle in terms of the Cartesian coordinates of the vertices of the inscribed triangle. Suppose that A = B = C = are the coordinates of points A, B, using the polarization identity, these equations reduce to the condition that the matrix has a nonzero kernel. Thus the circumcircle may alternatively be described as the locus of zeros of the determinant of this matrix, a similar approach allows one to deduce the equation of the circumsphere of a tetrahedron. A unit vector perpendicular to the containing the circle is given by n ^ = × | × |. An equation for the circumcircle in trilinear coordinates x, y, z is a/x + b/y + c/z =0, an equation for the circumcircle in barycentric coordinates x, y, z is a2/x + b2/y + c2/z =0. The isogonal conjugate of the circumcircle is the line at infinity, given in coordinates by ax + by + cz =0. Additionally, the circumcircle of a triangle embedded in d dimensions can be using a generalized method. Let A, B, and C be d-dimensional points, which form the vertices of a triangle and we start by transposing the system to place C at the origin, a = A − C, b = B − C. The circumcenter, p0, is given by p 0 = ×2 ∥ a × b ∥2 + C, the Cartesian coordinates of the circumcenter are U x =1 D U y =1 D with D =2. Without loss of generality this can be expressed in a form after translation of the vertex A to the origin of the Cartesian coordinate systems
10.
Equilateral polygon
–
In geometry, three or more than three straight lines make a polygon and an equilateral polygon is a polygon which has all sides of the same length. Except in the case, it need not be equiangular. If the number of sides is at least five, an equilateral polygon need not be a convex polygon, all regular polygons and isotoxal polygons are equilateral. An equilateral triangle is a triangle with 60° internal angles. An equilateral quadrilateral is called a rhombus, an isotoxal polygon described by an angle α and it includes the square as a special case. A convex equilateral pentagon can be described by two angles α and β, which determine the other angles. Concave equilateral pentagons exist, as do concave equilateral polygons with any number of sides. An equilateral polygon which is cyclic is a regular polygon, a tangential polygon is equilateral if and only if the alternate angles are equal. Thus if the number of n is odd, a tangential polygon is equilateral if. The principal diagonals of a hexagon each divide the hexagon into quadrilaterals, in any convex equilateral hexagon with common side a, there exists a principal diagonal d1 such that d 1 a ≤2 and a principal diagonal d2 such that d 2 a >3. Triambi are equilateral hexagons with trigonal symmetry, Equilateral triangle With interactive animation A Property of Equiangular Polygons, a discussion of Vivianis theorem at Cut-the-knot
11.
Isogonal figure
–
In geometry, a polytope is isogonal or vertex-transitive if, loosely speaking, all its vertices are equivalent. That implies that each vertex is surrounded by the kinds of face in the same or reverse order. Technically, we say that for any two vertices there exists a symmetry of the polytope mapping the first isometrically onto the second. Other ways of saying this are that the group of automorphisms of the polytope is transitive on its vertices, all vertices of a finite n-dimensional isogonal figure exist on an -sphere. The term isogonal has long used for polyhedra. Vertex-transitive is a synonym borrowed from modern ideas such as symmetry groups, all regular polygons, apeirogons and regular star polygons are isogonal. The dual of a polygon is an isotoxal polygon. Some even-sided polygons and apeirogons which alternate two edge lengths, for example a rectangle, are isogonal, all planar isogonal 2n-gons have dihedral symmetry with reflection lines across the mid-edge points. An isogonal polyhedron and 2D tiling has a kind of vertex. An isogonal polyhedron with all faces is also a uniform polyhedron. Geometrically distorted variations of uniform polyhedra and tilings can also be given the vertex configuration, isogonal polyhedra and 2D tilings may be further classified, Regular if it is also isohedral and isotoxal, this implies that every face is the same kind of regular polygon. Quasi-regular if it is also isotoxal but not isohedral, semi-regular if every face is a regular polygon but it is not isohedral or isotoxal. Uniform if every face is a polygon, i. e. it is regular, quasiregular or semi-regular. Noble if it is also isohedral and these definitions can be extended to higher-dimensional polytopes and tessellations. Most generally, all uniform polytopes are isogonal, for example, the dual of an isogonal polytope is called an isotope which is transitive on its facets. A polytope or tiling may be called if its vertices form k transitivity classes. A more restrictive term, k-uniform is defined as a figure constructed only from regular polygons. They can be represented visually with colors by different uniform colorings, edge-transitive Face-transitive Peter R. Cromwell, Polyhedra, Cambridge University Press 1997, ISBN 0-521-55432-2, p.369 Transitivity Grünbaum, Branko, Shephard, G. C
12.
Isotoxal figure
–
In geometry, a polytope, or a tiling, is isotoxal or edge-transitive if its symmetries act transitively on its edges. The term isotoxal is derived from the Greek τοξον meaning arc, an isotoxal polygon is an equilateral polygon, but not all equilateral polygons are isotoxal. The duals of isotoxal polygons are isogonal polygons, in general, an isotoxal 2n-gon will have Dn dihedral symmetry. A rhombus is a polygon with D2 symmetry. All regular polygons are isotoxal, having double the symmetry order. A regular 2n-gon is a polygon and can be marked with alternately colored vertices. An isotoxal polyhedron or tiling must be either isogonal or isohedral or both, regular polyhedra are isohedral, isogonal and isotoxal. Quasiregular polyhedra are isogonal and isotoxal, but not isohedral, their duals are isohedral and isotoxal, not every polyhedron or 2-dimensional tessellation constructed from regular polygons is isotoxal. An isotoxal polyhedron has the dihedral angle for all edges. There are nine convex isotoxal polyhedra formed from the Platonic solids,8 formed by the Kepler–Poinsot polyhedra, cS1 maint, Multiple names, authors list Coxeter, Harold Scott MacDonald, Longuet-Higgins, M. S. Miller, J. C. P. Uniform polyhedra, Philosophical Transactions of the Royal Society of London, mathematical and Physical Sciences,246, 401–450, doi,10. 1098/rsta.1954.0003, ISSN 0080-4614, JSTOR91532, MR0062446
13.
Geometry
–
Geometry is a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space. A mathematician who works in the field of geometry is called a geometer, Geometry arose independently in a number of early cultures as a practical way for dealing with lengths, areas, and volumes. Geometry began to see elements of mathematical science emerging in the West as early as the 6th century BC. By the 3rd century BC, geometry was put into a form by Euclid, whose treatment, Euclids Elements. Geometry arose independently in India, with texts providing rules for geometric constructions appearing as early as the 3rd century BC, islamic scientists preserved Greek ideas and expanded on them during the Middle Ages. By the early 17th century, geometry had been put on a solid footing by mathematicians such as René Descartes. Since then, and into modern times, geometry has expanded into non-Euclidean geometry and manifolds, while geometry has evolved significantly throughout the years, there are some general concepts that are more or less fundamental to geometry. These include the concepts of points, lines, planes, surfaces, angles, contemporary geometry has many subfields, Euclidean geometry is geometry in its classical sense. The mandatory educational curriculum of the majority of nations includes the study of points, lines, planes, angles, triangles, congruence, similarity, solid figures, circles, Euclidean geometry also has applications in computer science, crystallography, and various branches of modern mathematics. Differential geometry uses techniques of calculus and linear algebra to problems in geometry. It has applications in physics, including in general relativity, topology is the field concerned with the properties of geometric objects that are unchanged by continuous mappings. In practice, this often means dealing with large-scale properties of spaces, convex geometry investigates convex shapes in the Euclidean space and its more abstract analogues, often using techniques of real analysis. It has close connections to convex analysis, optimization and functional analysis, algebraic geometry studies geometry through the use of multivariate polynomials and other algebraic techniques. It has applications in areas, including cryptography and string theory. Discrete geometry is concerned mainly with questions of relative position of simple objects, such as points. It shares many methods and principles with combinatorics, Geometry has applications to many fields, including art, architecture, physics, as well as to other branches of mathematics. The earliest recorded beginnings of geometry can be traced to ancient Mesopotamia, the earliest known texts on geometry are the Egyptian Rhind Papyrus and Moscow Papyrus, the Babylonian clay tablets such as Plimpton 322. For example, the Moscow Papyrus gives a formula for calculating the volume of a truncated pyramid, later clay tablets demonstrate that Babylonian astronomers implemented trapezoid procedures for computing Jupiters position and motion within time-velocity space
14.
Polygon
–
In elementary geometry, a polygon /ˈpɒlɪɡɒn/ is a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed polygonal chain or circuit. These segments are called its edges or sides, and the points where two edges meet are the vertices or corners. The interior of the polygon is called its body. An n-gon is a polygon with n sides, for example, a polygon is a 2-dimensional example of the more general polytope in any number of dimensions. The basic geometrical notion of a polygon has been adapted in various ways to suit particular purposes, mathematicians are often concerned only with the bounding closed polygonal chain and with simple polygons which do not self-intersect, and they often define a polygon accordingly. A polygonal boundary may be allowed to intersect itself, creating star polygons and these and other generalizations of polygons are described below. The word polygon derives from the Greek adjective πολύς much, many and it has been suggested that γόνυ knee may be the origin of “gon”. Polygons are primarily classified by the number of sides, Polygons may be characterized by their convexity or type of non-convexity, Convex, any line drawn through the polygon meets its boundary exactly twice. As a consequence, all its interior angles are less than 180°, equivalently, any line segment with endpoints on the boundary passes through only interior points between its endpoints. Non-convex, a line may be found which meets its boundary more than twice, equivalently, there exists a line segment between two boundary points that passes outside the polygon. Simple, the boundary of the polygon does not cross itself, there is at least one interior angle greater than 180°. Star-shaped, the interior is visible from at least one point. The polygon must be simple, and may be convex or concave, self-intersecting, the boundary of the polygon crosses itself. Branko Grünbaum calls these coptic, though this term does not seem to be widely used, star polygon, a polygon which self-intersects in a regular way. A polygon cannot be both a star and star-shaped, equiangular, all corner angles are equal. Cyclic, all lie on a single circle, called the circumcircle. Isogonal or vertex-transitive, all lie within the same symmetry orbit. The polygon is cyclic and equiangular
15.
Pierpont prime
–
A Pierpont prime is a prime number of the form 2 u 3 v +1 for some nonnegative integers u and v. That is, they are the prime numbers p for which p −1 is 3-smooth. They are named after the mathematician James Pierpont, who introduced them in the study of regular polygons that can be constructed using conic sections. It is possible to prove that if v =0 and u >0, then u must be a power of 2, if v is positive then u must also be positive, and the Pierpont prime is of the form 6k +1. Empirically, the Pierpont primes do not seem to be rare or sparsely distributed. There are 36 Pierpont primes less than 106,59 less than 109,151 less than 1020, there are few restrictions from algebraic factorisations on the Pierpont primes, so there are no requirements like the Mersenne prime condition that the exponent must be prime. As there are Θ numbers of the form in this range. Andrew M. Gleason made this explicit, conjecturing there are infinitely many Pierpont primes. According to Gleasons conjecture there are Θ Pierpont primes smaller than N, when 2 u >3 v, the primality of 2 u 3 v +1 can be tested by Proths theorem. As part of the ongoing search for factors of Fermat numbers. The following table gives values of m, k, and n such that k ⋅2 n +1 divides 22 m +1, the left-hand side is a Pierpont prime when k is a power of 3, the right-hand side is a Fermat number. As of 2017, the largest known Pierpont prime is 3 ×210829346 +1, whose primality was discovered by Sai Yik Tang, in the mathematics of paper folding, the Huzita axioms define six of the seven types of fold possible. It has been shown that these folds are sufficient to allow the construction of the points that solve any cubic equation. It follows that they allow any regular polygon of N sides to be formed, as long as N >3 and of the form 2m3nρ and this is the same class of regular polygons as those that can be constructed with a compass, straightedge, and angle-trisector. Regular polygons which can be constructed with compass and straightedge are the special case where n =0 and ρ is a product of distinct Fermat primes, themselves a subset of Pierpont primes. In 1895, James Pierpont studied the same class of regular polygons, Pierpont generalized compass and straightedge constructions in a different way, by adding the ability to draw conic sections whose coefficients come from previously constructed points. As he showed, the regular N-gons that can be constructed with these operations are the ones such that the totient of N is 3-smooth. Since the totient of a prime is formed by subtracting one from it, however, Pierpont did not describe the form of the composite numbers with 3-smooth totients. As Gleason later showed, these numbers are exactly the ones of the form 2m3nρ given above, the smallest prime that is not a Pierpont prime is 11, therefore, the hendecagon is the smallest regular polygon that cannot be constructed with compass, straightedge and angle trisector
16.
Compass-and-straightedge construction
–
The idealized ruler, known as a straightedge, is assumed to be infinite in length, and has no markings on it and only one edge. The compass is assumed to collapse when lifted from the page, more formally, the only permissible constructions are those granted by Euclids first three postulates. It turns out to be the case that every point constructible using straightedge, the ancient Greek mathematicians first conceived compass-and-straightedge constructions, and a number of ancient problems in plane geometry impose this restriction. The ancient Greeks developed many constructions, but in cases were unable to do so. Gauss showed that some polygons are constructible but that most are not, some of the most famous straightedge-and-compass problems were proven impossible by Pierre Wantzel in 1837, using the mathematical theory of fields. In spite of existing proofs of impossibility, some persist in trying to solve these problems, in terms of algebra, a length is constructible if and only if it represents a constructible number, and an angle is constructible if and only if its cosine is a constructible number. A number is constructible if and only if it can be using the four basic arithmetic operations. Circles can only be starting from two given points, the centre and a point on the circle. The compass may or may not collapse when its not drawing a circle, the straightedge is infinitely long, but it has no markings on it and has only one straight edge, unlike ordinary rulers. It can only be used to draw a segment between two points or to extend an existing segment. The modern compass generally does not collapse and several modern constructions use this feature and it would appear that the modern compass is a more powerful instrument than the ancient collapsing compass. However, by Proposition 2 of Book 1 of Euclids Elements, although the proposition is correct, its proofs have a long and checkered history. Eyeballing it and getting close does not count as a solution and that is, it must have a finite number of steps, and not be the limit of ever closer approximations. One of the purposes of Greek mathematics was to find exact constructions for various lengths, for example. The Greeks could not find constructions for these three problems, among others, Squaring the circle, Drawing a square the same area as a given circle, doubling the cube, Drawing a cube with twice the volume of a given cube. Trisecting the angle, Dividing a given angle into three smaller angles all of the same size, for 2000 years people tried to find constructions within the limits set above, and failed. All three have now been proven under mathematical rules to be generally impossible, the ancient Greek mathematicians first attempted compass-and-straightedge constructions, and they discovered how to construct sums, differences, products, ratios, and square roots of given lengths. They could also construct half of an angle, a square whose area is twice that of another square, a square having the same area as a given polygon
17.
Neusis construction
–
The neusis is a geometric construction method that was used in antiquity by Greek mathematicians. The neusis construction consists of fitting a line element of length in between two given lines, in such a way that the line element, or its extension. That is, one end of the element has to lie on l. A neusis construction might be performed by means of a neusis ruler, in the figure one end of the ruler is marked with a yellow eye with crosshairs, this is the origin of the scale division on the ruler. A second marking on the ruler indicates the distance a from the origin, the yellow eye is moved along line l, until the blue eye coincides with line m. The position of the element thus found is shown in the figure as a dark blue bar. Point P is called the pole of the neusis, line l the directrix, or guiding line, length a is called the diastema. Neuseis have been important because they provide a means to solve geometric problems that are not solvable by means of compass. Examples are the trisection of any angle in three parts, the doubling of the cube, and the construction of a regular heptagon, nonagon. Mathematicians such as Archimedes of Syracuse and Pappus of Alexandria freely used neuseis, Sir Isaac Newton followed their line of thought, nevertheless, gradually the technique dropped out of use. Modified by the recent finding by Benjamin and Snyder that the regular hendecagon is neusis-constructible, T. L. Heath, the historian of mathematics, has suggested that the Greek mathematician Oenopides was the first to put compass-and-straightedge constructions above neuseis. One hundred years after him Euclid too shunned neuseis in his influential textbook. The next attack on the neusis came when, from the fourth century BC, under its influence a hierarchy of three classes of geometrical constructions was developed. In the end the use of neusis was deemed acceptable only when the two other, higher categories of constructions did not offer a solution, Neusis became a kind of last resort that was invoked only when all other, more respectable, methods had failed. Using neusis where other methods might have been used was branded by the late Greek mathematician Pappus of Alexandria as a not inconsiderable error. R. Boeker, Neusis, in, Paulys Realencyclopädie der Classischen Altertumswissenschaft, the most comprehensive survey, however, the author sometimes has rather curious opinions. T. L. Heath, A history of Greek Mathematics, H. G. Zeuthen, Die Lehre von den Kegelschnitten im Altertum. MathWorld page Angle Trisection by Paper Folding
18.
Andrew M. Gleason
–
Gleasons theorem in quantum logic and the Greenwood–Gleason graph, an important example in Ramsey theory, are named for him. Gleasons entire academic career was at Harvard University, from which he retired in 1992 and his numerous academic and scholarly leadership posts included chairmanship of the Harvard Mathematics Department and Harvard Society of Fellows, and presidency of the American Mathematical Society. He continued to advise the United States government on security. Gleason won the Newcomb Cleveland Prize in 1952 and the Gung–Hu Distinguished Service Award of the American Mathematical Society in 1996 and he was a member of the National Academy of Sciences and of the American Philosophical Society, and held the Hollis Chair of Mathematics and Natural Philosophy at Harvard. He was fond of saying that mathematical proofs really arent there to convince you that something is there to show you why it is true. His older brother Henry, Jr. became a linguist and he grew up in Bronxville, New York, where his father was the curator of the New York Botanical Garden. After briefly attending Berkeley High School he graduated from Roosevelt High School in Yonkers, so I learned first year calculus and second year calculus and became the consultant to one end of the whole Old Campus. I used to do all the homework for all the sections of, I got plenty of practice in doing elementary calculus problems. I dont think there exists a problem—the classical kind of pseudo reality problem which first, one month later he enrolled in a differential equations course as well. When Einar Hille temporarily replaced the regular instructor, Gleason found Hilles style unbelievably different and he had a view of mathematics that was just vastly different. That was an important experience for me. So after that I took a lot of courses from Hille including, in his sophomore year, starting with that course with Hille, I began to have some sense of what mathematics is about. While at Yale he competed three times in the recently founded William Lowell Putnam Mathematical Competition, always placing among the top five entrants in the country. After the Japanese attacked Pearl Harbor during his year, Gleason applied for a commission in the US Navy. In 1946, at the recommendation of Navy colleague Donald Howard Menzel and he returned to Harvard in the fall of 1952, and soon after published the most important of his results on Hilberts fifth problem. Harvard awarded him tenure the following year, in January 1959 he married Jean Berko whom he had met at a party featuring the music of Tom Lehrer. Berko, a psycholinguist, worked for years at Boston University. In 1969 Gleason took the Hollis Chair of Mathematics and Natural Philosophy and he died in 2008 from complications following surgery
19.
Angle trisection
–
Angle trisection is a classical problem of compass and straightedge constructions of ancient Greek mathematics. It concerns construction of an equal to one third of a given arbitrary angle. The problem as stated is generally impossible to solve, as proved by Pierre Wantzel in 1837, however, although there is no way to trisect an angle in general with just a compass and a straightedge, some special angles can be trisected. For example, it is straightforward to trisect a right angle. It is possible to trisect an angle by using tools other than straightedge. For example, neusis construction, also known to ancient Greeks, involves simultaneous sliding and rotation of a marked straightedge, other techniques were developed by mathematicians over the centuries. Because it is defined in terms, but complex to prove unsolvable. These solutions often involve mistaken interpretations of the rules, or are simply incorrect, three problems proved elusive, specifically, trisecting the angle, doubling the cube, and squaring the circle. The problem of angle trisection reads, Construct an angle equal to one-third of an arbitrary angle. Pierre Wantzel published a proof of the impossibility of trisecting an arbitrary angle in 1837. Wantzels proof, restated in modern terminology, uses the algebra of field extensions. However Wantzel published these results earlier than Galois and did not use the connection between field extensions and groups that is the subject of Galois theory itself. The problem of constructing an angle of a given measure θ is equivalent to constructing two segments such that the ratio of their length is cos θ. From a solution to one of two problems, one may pass to a solution of the other by a compass and straightedge construction. The triple-angle formula gives an expression relating the cosines of the angle and its trisection. It follows that, given a segment that is defined to have unit length and this equivalence reduces the original geometric problem to a purely algebraic problem. Every irrational number which is constructible in a step from some given numbers is a root of a polynomial of degree 2 with coefficients in the field generated by these numbers. Therefore, any number which is constructible by a sequence of steps is a root of a polynomial whose degree is a power of two
20.
Tomahawk (geometry)
–
The tomahawk is a tool in geometry for angle trisection, the problem of splitting an angle into three equal parts. The boundaries of its shape include a semicircle and two segments, arranged in a way that resembles a tomahawk, a Native American axe. The same tool has also called the shoemakers knife, but that name is more commonly used in geometry to refer to a different shape. In order to make it into a tool, its handle and spike may be thickened. Unlike a related trisection using a square, the other side of the thickened handle does not need to be made parallel to this line segment. One of the two trisecting lines then lies on the segment, and the other passes through the center point of the semicircle. The reason for this is that placing the constructed tomahawk into the position is a form of neusis that is not allowed in compass. The inventor of the tomahawk is unknown, but the earliest references to it come from 19th-century France. It dates back at least as far as 1835, when it appeared in a book by Claude Lucien Bergery, Géométrie appliquée à lindustrie, à lusage des artistes et des ouvriers. Another early publication of the same trisection was made by Henri Brocard in 1877, trisection using special tools, Tomahawk, Takaya Iwamoto,2006, featuring a tomahawk tool made from transparent vinyl and comparisons for accuracy against other trisectors Weisstein, Eric W. Tomahawk
21.
Straightedge
–
A straightedge is a tool with an edge free from curves, or straight, used for transcribing straight lines, or checking the straightness of lines. If it has equally spaced markings along its length, it is called a ruler. Straightedges are used in the service and machining industry to check the flatness of machined mating surfaces. A pair of straightedges called winding sticks are used in woodworking to amplify twist in pieces of wood, an idealized straightedge is used in compass-and-straightedge constructions in plane geometry. It may be used, Given two points, to draw the line connecting them, Given a point and a circle, to draw either tangent. Given two circles, to any of their common tangents. It may not be marked or used together with the compass so as to transfer the length of one segment to another and it is possible to do all compass and straightedge constructions without the straightedge. That is, it is possible, using only a compass and it is not, however, possible to do all constructions using only a straightedge. It is possible to do them with straightedge alone given one circle, chalk line Geometrography Wayne R. Moore, Foundations of Mechanical Accuracy, Moore Special Tool Company, Bridgeport, CT Making Accurate Straight-Edges from Scratch
22.
Compass (drawing tool)
–
A pair of compasses, also known simply as a compass, is a technical drawing instrument that can be used for inscribing circles or arcs. As dividers, they can also be used as tools to measure distances, Compasses can be used for mathematics, drafting, navigation and other purposes. Compasses are usually made of metal or plastic, and consist of two connected by a hinge which can be adjusted to allow the changing of the radius of the circle drawn. Typically one part has a spike at its end, and the part a pencil. Prior to computerization, compasses and other tools for manual drafting were often packaged as a bow set with interchangeable parts, today these facilities are more often provided by computer-aided design programs, so the physical tools serve mainly a didactic purpose in teaching geometry, technical drawing, etc. Compasses are usually made of metal or plastic, and consist of two connected by a hinge which can be adjusted to allow the changing of the radius of the circle drawn. Typically one part has a spike at its end, and the part a pencil. The handle is usually half a inch long. Users can grip it between their pointer finger and thumb, there are two types of legs in a pair of compasses, the straight or the steady leg and the adjustable one. Each has a purpose, the steady leg serves as the basis or support for the needle point. The screw on your hinge holds the two legs in its position, the hinge can be adjusted depending on desired stiffness, the tighter the screw the better the compass’ performance. The needle point is located on the leg, and serves as the center point of circles that are drawn. The pencil lead draws the circle on a paper or material. This holds the lead or pen in place. Circles can be made by fastening one leg of the compasses into the paper with the spike, putting the pencil on the paper, the radius of the circle can be adjusted by changing the angle of the hinge. Distances can be measured on a map using compasses with two spikes, also called a dividing compass, to use a pair of compasses, place the points on a ruler and open it to the measurement of ½ of the measurement of the circle that is desired. For instance, if one desires to draw a 3 inch circle, next, place the point on the spot that you wish the center of your circle to be, and then rotate the section that has the pencil lead around the point, using the handle. Compasses-and-straightedge constructions are used to illustrate principles of plane geometry, although a real pair of compasses is used to draft visible illustrations, the ideal compass used in proofs is an abstract creator of perfect circles
23.
GeoGebra
–
GeoGebra is an interactive geometry, algebra, statistics and calculus application, intended for learning and teaching mathematics and science from primary school to university level. After a successful Kickstarter campaign, GeoGebra expanded their offerings to include an iPad, an Android, in 2013, Bernard Parisses Giac was integrated into GeoGebras CAS view. GeoGebra is an interactive mathematics software program for learning and teaching mathematics, constructions can be made with points, vectors, segments, lines, polygons, conic sections, inequalities, implicit polynomials and functions. All of them can be changed dynamically afterwards, elements can be entered and modified directly via mouse and touch, or through the Input Bar. GeoGebra has the ability to use variables for numbers, vectors and points, find derivatives, teachers and students can use GeoGebra to make conjectures and to understand how to prove geometric theorems. GeoGebra Materials was initially launched under the name GeoGebraTube in June 2011, GeoGebra materials can be also exported in several formats, including as static images or as Animated GIF. SVG vector images can be edited using third party software. EMF vector formats can be imported in several Office applications. There are also options for exporting to the clipboard, PNG, PDF. GeoGebra can also create code that can be used inside LaTeX files through its PSTricks, PGF/TikZ, GeoGebras source code is licensed under the GNU General Public License and all other non-software components are under Creative Commons BY-NC-SA. Thus, commercial use is subject to a license and collaboration agreement. IGI joins teachers, students, software developers and researchers to support, develop, translate and organise the GeoGebra related tasks, the local user groups support students and teachers in their region. As part of the International GeoGebra Institute network they share free educational materials via the GeoGebra Materials platform, organize workshops, the International GeoGebra Institute may certify local GeoGebra users, experts, and trainers according to certain guidelines. a. R. Graphmatica Kig DrGeo Official website GeoGebras channel on YouTube Development coordination site
24.
Prime number
–
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a number is called a composite number. For example,5 is prime because 1 and 5 are its only positive integer factors, the property of being prime is called primality. A simple but slow method of verifying the primality of a number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and n, algorithms much more efficient than trial division have been devised to test the primality of large numbers. Particularly fast methods are available for numbers of forms, such as Mersenne numbers. As of January 2016, the largest known prime number has 22,338,618 decimal digits, there are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no simple formula that separates prime numbers from composite numbers. However, the distribution of primes, that is to say, many questions regarding prime numbers remain open, such as Goldbachs conjecture, and the twin prime conjecture. Such questions spurred the development of branches of number theory. Prime numbers give rise to various generalizations in other domains, mainly algebra, such as prime elements. A natural number is called a number if it has exactly two positive divisors,1 and the number itself. Natural numbers greater than 1 that are not prime are called composite, among the numbers 1 to 6, the numbers 2,3, and 5 are the prime numbers, while 1,4, and 6 are not prime. 1 is excluded as a number, for reasons explained below. 2 is a number, since the only natural numbers dividing it are 1 and 2. Next,3 is prime, too,1 and 3 do divide 3 without remainder, however,4 is composite, since 2 is another number dividing 4 without remainder,4 =2 ·2. 5 is again prime, none of the numbers 2,3, next,6 is divisible by 2 or 3, since 6 =2 ·3. The image at the right illustrates that 12 is not prime,12 =3 ·4, no even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1,2, and n
25.
Cyclic group
–
In algebra, a cyclic group or monogenous group is a group that is generated by a single element. Each element can be written as a power of g in multiplicative notation and this element g is called a generator of the group. Every infinite cyclic group is isomorphic to the group of Z. Every finite cyclic group of n is isomorphic to the additive group of Z/nZ. Every cyclic group is a group, and every finitely generated abelian group is a direct product of cyclic groups. A group G is called if there exists an element g in G such that G = ⟨g⟩ =. Since any group generated by an element in a group is a subgroup of that group, for example, if G = is a group of order 6, then g6 = g0, and G is cyclic. In fact, G is essentially the same as the set with addition modulo 6, for example,1 +2 ≡3 corresponds to g1 · g2 = g3, and 2 +5 ≡1 corresponds to g2 · g5 = g7 = g1, and so on. One can use the isomorphism χ defined by χ = i, the name cyclic may be misleading, it is possible to generate infinitely many elements and not form any literal cycles, that is, every gn is distinct. A group generated in this way is called a cyclic group. The French mathematicians known as Nicolas Bourbaki referred to a group as a monogenous group. The set of integers, with the operation of addition, forms a group and it is an infinite cyclic group, because all integers can be written as a finite sum or difference of copies of the number 1. In this group,1 and −1 are the only generators, every infinite cyclic group is isomorphic to this group. For every positive n, the set of integers modulo n, again with the operation of addition, forms a finite cyclic group. An element g is a generator of this group if g is relatively prime to n, thus, the number of different generators is φ, where φ is the Euler totient function, the function that counts the number of numbers modulo n that are relatively prime to n. Every finite cyclic group is isomorphic to a group Z/n, where n is the order of the group, the integer and modular addition operations, used to define the cyclic groups, are both the addition operations of commutative rings, also denoted Z and Z/n. If p is a prime, then Z/p is a finite field, every field with p elements is isomorphic to this one. For every positive n, the subset of the integers modulo n that are relatively prime to n, with the operation of multiplication
26.
John Horton Conway
–
John Horton Conway FRS is an English mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He has also contributed to many branches of mathematics, notably the invention of the cellular automaton called the Game of Life. Conway is currently Professor Emeritus of Mathematics at Princeton University in New Jersey, Conway was born in Liverpool, the son of Cyril Horton Conway and Agnes Boyce. He became interested in mathematics at an early age, his mother has recalled that he could recite the powers of two when he was four years old. By the age of eleven his ambition was to become a mathematician, after leaving secondary school, Conway entered Gonville and Caius College, Cambridge to study mathematics. Conway, who was a terribly introverted adolescent in school, interpreted his admission to Cambridge as an opportunity to transform himself into a new person and he was awarded his Bachelor of Arts degree in 1959 and began to undertake research in number theory supervised by Harold Davenport. Having solved the problem posed by Davenport on writing numbers as the sums of fifth powers. It appears that his interest in games began during his years studying the Cambridge Mathematical Tripos and he was awarded his doctorate in 1964 and was appointed as College Fellow and Lecturer in Mathematics at the University of Cambridge. After leaving Cambridge in 1986, he took up the appointment to the John von Neumann Chair of Mathematics at Princeton University, Conway is especially known for the invention of the Game of Life, one of the early examples of a cellular automaton. His initial experiments in that field were done with pen and paper, since the game was introduced by Martin Gardner in Scientific American in 1970, it has spawned hundreds of computer programs, web sites, and articles. It is a staple of recreational mathematics, there is an extensive wiki devoted to curating and cataloging the various aspects of the game. From the earliest days it has been a favorite in computer labs, at times Conway has said he hates the game of life–largely because it has come to overshadow some of the other deeper and more important things he has done. Nevertheless, the game did help launch a new branch of mathematics, the Game of Life is now known to be Turing complete. Conways career is intertwined with mathematics popularizer and Scientific American columnist Martin Gardner, when Gardner featured Conways Game of Life in his Mathematical Games column in October 1970, it became the most widely read of all his columns and made Conway an instant celebrity. Gardner and Conway had first corresponded in the late 1950s, for instance, he discussed Conways game of Sprouts, Hackenbush, and his angel and devil problem. In the September 1976 column he reviewed Conways book On Numbers and Games, Conway is widely known for his contributions to combinatorial game theory, a theory of partisan games. This he developed with Elwyn Berlekamp and Richard Guy, and with them also co-authored the book Winning Ways for your Mathematical Plays and he also wrote the book On Numbers and Games which lays out the mathematical foundations of CGT. He is also one of the inventors of sprouts, as well as philosophers football and he developed detailed analyses of many other games and puzzles, such as the Soma cube, peg solitaire, and Conways soldiers
27.
Directed graph
–
In mathematics, and more specifically in graph theory, a directed graph is a graph that is a set of vertices connected by edges, where the edges have a direction associated with them. It differs from an ordinary or undirected graph, in that the latter is defined in terms of unordered pairs of vertices, more specifically, these entities are addressed as directed multigraphs. On the other hand, the definition allows a directed graph to have loops. More specifically, directed graphs without loops are addressed as directed graphs. Symmetric directed graphs are directed graphs where all edges are bidirected, simple directed graphs are directed graphs that have no loops and no multiple arrows with same source and target nodes. As already introduced, in case of arrows the entity is usually addressed as directed multigraph. Some authors describe digraphs with loops as loop-digraphs. Complete directed graphs are directed graphs where each pair of vertices is joined by a symmetric pair of directed arrows. It follows that a complete digraph is symmetric, oriented graphs are directed graphs having no bidirected edges. It follows that a graph is an oriented graph iff it hasnt any 2-cycle. Tournaments are oriented graphs obtained by choosing a direction for each edge in undirected complete graphs. Directed acyclic graphs are directed graphs with no directed cycles, multitrees are DAGs in which no two directed paths from a single starting vertex meet back at the same ending vertex. Oriented trees or polytrees are DAGs formed by orienting the edges of undirected acyclic graphs, rooted trees are oriented trees in which all edges of the underlying undirected tree are directed away from the roots. Rooted directed graphs are digraphs in which a vertex has been distinguished as the root, control flow graphs are rooted digraphs used in computer science as a representation of the paths that might be traversed through a program during its execution. Signal-flow graphs are directed graphs in which nodes represent system variables and branches represent functional connections between pairs of nodes, flow graphs are digraphs associated with a set of linear algebraic or differential equations. State diagrams are directed multigraphs that represent finite state machines, representations of a quiver label its vertices with vector spaces and its edges compatibly with linear transformations between them, and transform via natural transformations. If a path leads from x to y, then y is said to be a successor of x and reachable from x, the arrow is called the inverted arrow of. The adjacency matrix of a graph is unique up to identical permutation of rows. Another matrix representation for a graph is its incidence matrix. For a vertex, the number of head ends adjacent to a vertex is called the indegree of the vertex, the indegree of v is denoted deg− and its outdegree is denoted deg+
28.
Czech koruna
–
The koruna is the currency of the Czech Republic since 1993, and in English it is sometimes referred to as Czech crown. The koruna is one of European Unions 11 currencies, and the Czech Republic is legally bound to adopt the currency in the future. The official name in Czech is koruna česká, the ISO4217 code is CZK and the local acronym is Kč, which is placed after the numeric value. One koruna equals 100 haléřů, but haléře have been withdrawn, in 1892, the Austro-Hungarian krone replaced the Gulden, at the rate 1 Gulden =2 crowns. The name Krone was invented by the emperor, Franz Joseph I of Austria, after Austria-Hungary dissolved in 1918, the only successor state that kept the name of the currency, the crown, was Czechoslovakia. In the late 1920s, the Czechoslovak crown was the hardest currency in Europe, during the Second World War, the currency on the occupied Czech territory was artificially weakened. The Czechoslovak crown was restored after the war and it underwent a highly controversial monetary reform in 1953. The Czech koruna replaced the Czechoslovak koruna when it was introduced in 1993 after the dissolution of Czechoslovakia and it first consisted of overstamped 20,50,100,500, and 1000 Czechoslovak koruna banknotes, but a new series was properly introduced in 1993. In November 2013, the Czech National Bank has intervened to weaken the exchange rate of the koruna through a monetary stimulus in order to stop the currency from excessive strengthening, in late 2016, the CNB stated that the return to conventional monetary policy was planned for mid-2017. After high-than-expected inflation and other figures, the bank removed the floor on a special monetary meeting on April 6th,2017. Avoiding significant volatility, the koruna gradually strengthened 1. 55% on that day, the Czech Republic planned to adopt the euro in 2010, but its government suspended that plan indefinitely in 2005. Although the country is well positioned to adopt the euro. According to a survey conducted in April 2014, only 16% of the Czech population was in favour of replacing the koruna with euro. In 1993, coins were introduced in denominations of 10,20 and 50 haléřů,1,2,5,10,20 and 50 korun, in 2000, the 10 and 20 korun coins were minted with different obverses to commemorate the Millennium. In 1993 &1994 coins were minted in Winnipeg and Hamburg, all circulation coins were designed by Ladislav Kozak. Since 1997, sets for collectors are also issued yearly with proof quality coins, theres also a tradition of issuing commemorative coins – including silver and gold coins – for numismatic purposes. For a complete listing see, Commemorative coins of the Czech Republic, the first Czech banknotes issued on 8 February 1993 consisted of Czechoslovak notes with adhesive stamps affixed to them. Only the 100,500 and 1000 korun denominations were overstamped, each stamp bears a Roman and Arabic number identifying the denomination of the banknote to which it is affixed
29.
Star polygon
–
In geometry, a star polygon is a type of non-convex polygon. Only the regular polygons have been studied in any depth. The first usage is included in polygrams which includes polygons like the pentagram, star polygon names combine a numeral prefix, such as penta-, with the Greek suffix -gram. The prefix is normally a Greek cardinal, but synonyms using other prefixes exist, for example, a nine-pointed polygon or enneagram is also known as a nonagram, using the ordinal nona from Latin. The -gram suffix derives from γραμμή meaning a line, alternatively for integers p and q, it can be considered as being constructed by connecting every qth point out of p points regularly spaced in a circular placement. A regular star polygon is denoted by its Schläfli symbol, where p and q are relatively prime, the symmetry group of is dihedral group Dn of order 2n, independent of k. A regular star polygon can also be obtained as a sequence of stellations of a regular core polygon. Regular star polygons were first studied systematically by Thomas Bradwardine, if p and q are not coprime, a degenerate polygon will result with coinciding vertices and edges. For example will appear as a triangle, but can be labeled with two sets of vertices 1-6 and this should be seen not as two overlapping triangles, but a double-winding of a single unicursal hexagon. For |n/d|, the vertices have an exterior angle, β. These polygons are often seen in tiling patterns, the parametric angle α can be chosen to match internal angles of neighboring polygons in a tessellation pattern. The interior of a polygon may be treated in different ways. Three such treatments are illustrated for a pentagram, branko Grunbaum and Geoffrey Shephard consider two of them, as regular star polygons and concave isogonal 2n-gons. These include, Where a side occurs, one side is treated as outside and this is shown in the left hand illustration and commonly occurs in computer vector graphics rendering. The number of times that the polygonal curve winds around a given region determines its density, the exterior is given a density of 0, and any region of density >0 is treated as internal. This is shown in the illustration and commonly occurs in the mathematical treatment of polyhedra. Where a line may be drawn between two sides, the region in which the line lies is treated as inside the figure and this is shown in the right hand illustration and commonly occurs when making a physical model. When the area of the polygon is calculated, each of these approaches yields a different answer, star polygons feature prominently in art and culture
30.
Petrie polygon
–
In geometry, a Petrie polygon for a regular polytope of n dimensions is a skew polygon such that every consecutive sides belong to one of the facets. The Petrie polygon of a polygon is the regular polygon itself. For every regular polytope there exists an orthogonal projection onto a plane such that one Petrie polygon becomes a regular polygon with the remainder of the interior to it. The plane in question is the Coxeter plane of the group of the polygon. These polygons and projected graphs are useful in visualizing symmetric structure of the regular polytopes. John Flinders Petrie was the son of Egyptologist Flinders Petrie. He was born in 1907 and as a schoolboy showed remarkable promise of mathematical ability, in periods of intense concentration he could answer questions about complicated four-dimensional objects by visualizing them. He first noted the importance of the skew polygons which appear on the surface of regular polyhedra. When my incredulity had begun to subside, he described them to me, one consisting of squares, six at each vertex, in 1938 Petrie collaborated with Coxeter, Patrick du Val, and H. T. Flather to produce The Fifty-Nine Icosahedra for publication, realizing the geometric facility of the skew polygons used by Petrie, Coxeter named them after his friend when he wrote Regular Polytopes. In 1972, a few months after his retirement, Petrie was killed by a car attempting to cross a motorway near his home in Surrey. The idea of Petrie polygons was later extended to semiregular polytopes, the Petrie polygon of the regular polyhedron has h sides, where h+2=24/. The regular duals, and, are contained within the same projected Petrie polygon, three of the Kepler–Poinsot polyhedra have hexagonal, and decagrammic, petrie polygons. The Petrie polygon projections are most useful for visualization of polytopes of dimension four and this table represents Petrie polygon projections of 3 regular families, and the exceptional Lie group En which generate semiregular and uniform polytopes for dimensions 4 to 8. Coxeter, H. S. M. Regular Polytopes, 3rd ed, Section 4.3 Flags and Orthoschemes, Section 11.3 Petrie polygons Ball, W. W. R. and H. S. M. Coxeter Mathematical Recreations and Essays, 13th ed. The Beauty of Geometry, Twelve Essays, Dover Publications LCCN 99-35678 Peter McMullen, Egon Schulte Abstract Regular Polytopes, ISBN 0-521-81496-0 Steinberg, Robert, ON THE NUMBER OF SIDES OF A PETRIE POLYGON Weisstein, Eric W. Petrie polygon. Weisstein, Eric W. Cross polytope graphs, Weisstein, Eric W. Gosset graph 3_21
31.
Simplex
–
In geometry, a simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. Specifically, a k-simplex is a polytope which is the convex hull of its k +1 vertices. More formally, suppose the k +1 points u 0, …, u k ∈ R k are affinely independent, then, the simplex determined by them is the set of points C =. For example, a 2-simplex is a triangle, a 3-simplex is a tetrahedron, a single point may be considered a 0-simplex, and a line segment may be considered a 1-simplex. A simplex may be defined as the smallest convex set containing the given vertices, a regular simplex is a simplex that is also a regular polytope. A regular n-simplex may be constructed from a regular -simplex by connecting a new vertex to all original vertices by the edge length. In topology and combinatorics, it is common to “glue together” simplices to form a simplicial complex, the associated combinatorial structure is called an abstract simplicial complex, in which context the word “simplex” simply means any finite set of vertices. A 1-simplex is a line segment, the convex hull of any nonempty subset of the n+1 points that define an n-simplex is called a face of the simplex. In particular, the hull of a subset of size m+1 is an m-simplex. The 0-faces are called the vertices, the 1-faces are called the edges, the -faces are called the facets, in general, the number of m-faces is equal to the binomial coefficient. Consequently, the number of m-faces of an n-simplex may be found in column of row of Pascals triangle, a simplex A is a coface of a simplex B if B is a face of A. Face and facet can have different meanings when describing types of simplices in a simplicial complex, see simplical complex for more detail. The regular simplex family is the first of three regular polytope families, labeled by Coxeter as αn, the two being the cross-polytope family, labeled as βn, and the hypercubes, labeled as γn. A fourth family, the infinite tessellation of hypercubes, he labeled as δn, an -simplex can be constructed as a join of an n-simplex and a point. An -simplex can be constructed as a join of an m-simplex, the two simplices are oriented to be completely normal from each other, with translation in a direction orthogonal to both of them. A 1-simplex is a joint of two points, ∨ =2, a general 2-simplex is the join of 3 points, ∨∨. An isosceles triangle is the join of a 1-simplex and a point, a general 3-simplex is the join of 4 points, ∨∨∨. A 3-simplex with mirror symmetry can be expressed as the join of an edge and 2 points, a 3-simplex with triangular symmetry can be expressed as the join of an equilateral triangle and 1 point,3. ∨ or ∨
32.
International Standard Book Number
–
The International Standard Book Number is a unique numeric commercial book identifier. An ISBN is assigned to each edition and variation of a book, for example, an e-book, a paperback and a hardcover edition of the same book would each have a different ISBN. The ISBN is 13 digits long if assigned on or after 1 January 2007, the method of assigning an ISBN is nation-based and varies from country to country, often depending on how large the publishing industry is within a country. The initial ISBN configuration of recognition was generated in 1967 based upon the 9-digit Standard Book Numbering created in 1966, the 10-digit ISBN format was developed by the International Organization for Standardization and was published in 1970 as international standard ISO2108. Occasionally, a book may appear without a printed ISBN if it is printed privately or the author does not follow the usual ISBN procedure, however, this can be rectified later. Another identifier, the International Standard Serial Number, identifies periodical publications such as magazines, the ISBN configuration of recognition was generated in 1967 in the United Kingdom by David Whitaker and in 1968 in the US by Emery Koltay. The 10-digit ISBN format was developed by the International Organization for Standardization and was published in 1970 as international standard ISO2108, the United Kingdom continued to use the 9-digit SBN code until 1974. The ISO on-line facility only refers back to 1978, an SBN may be converted to an ISBN by prefixing the digit 0. For example, the edition of Mr. J. G. Reeder Returns, published by Hodder in 1965, has SBN340013818 -340 indicating the publisher,01381 their serial number. This can be converted to ISBN 0-340-01381-8, the check digit does not need to be re-calculated, since 1 January 2007, ISBNs have contained 13 digits, a format that is compatible with Bookland European Article Number EAN-13s. An ISBN is assigned to each edition and variation of a book, for example, an ebook, a paperback, and a hardcover edition of the same book would each have a different ISBN. The ISBN is 13 digits long if assigned on or after 1 January 2007, a 13-digit ISBN can be separated into its parts, and when this is done it is customary to separate the parts with hyphens or spaces. Separating the parts of a 10-digit ISBN is also done with either hyphens or spaces, figuring out how to correctly separate a given ISBN number is complicated, because most of the parts do not use a fixed number of digits. ISBN issuance is country-specific, in that ISBNs are issued by the ISBN registration agency that is responsible for country or territory regardless of the publication language. Some ISBN registration agencies are based in national libraries or within ministries of culture, in other cases, the ISBN registration service is provided by organisations such as bibliographic data providers that are not government funded. In Canada, ISBNs are issued at no cost with the purpose of encouraging Canadian culture. In the United Kingdom, United States, and some countries, where the service is provided by non-government-funded organisations. Australia, ISBNs are issued by the library services agency Thorpe-Bowker
33.
Monogon
–
In geometry a monogon is a polygon with one edge and one vertex. Since a monogon has only one side and only one vertex, in Euclidean geometry a monogon is a degenerate polygon because its endpoints must coincide, unlike any Euclidean line segment. Most definitions of a polygon in Euclidean geometry do not admit the monogon, in spherical geometry, a monogon can be constructed as a vertex on a great circle. This forms a dihedron, with two hemispherical monogonal faces which share one 360° edge and one vertex and its dual, a hosohedron, has two antipodal vertices at the poles, one 360 degree lune face, and one edge between the two vertices. Digon Herbert Busemann, The geometry of geodesics, new York, Academic Press,1955 Coxeter, H. S. M, Regular Polytopes
34.
Digon
–
In geometry, a digon is a polygon with two sides and two vertices. Its construction is degenerate in a Euclidean plane because either the two sides would coincide or one or both would have to be curved, a regular digon has both angles equal and both sides equal and is represented by Schläfli symbol. It may be constructed on a sphere as a pair of 180 degree arcs connecting antipodal points, the digon is the simplest abstract polytope of rank 2. A truncated digon, t is a square, an alternated digon, h is a monogon. A straight-sided digon is regular even though it is degenerate, because its two edges are the length and its two angles are equal. As such, the regular digon is a constructible polygon, some definitions of a polygon do not consider the digon to be a proper polygon because of its degeneracy in the Euclidean case. A digon as a face of a polyhedron is degenerate because it is a degenerate polygon, but sometimes it can have a useful topological existence in transforming polyhedra. A spherical lune is a digon whose two vertices are antipodal points on the sphere, a spherical polyhedron constructed from such digons is called a hosohedron. The digon is an important construct in the theory of networks such as graphs. Topological equivalences may be established using a process of reduction to a set of polygons. The digon represents a stage in the simplification where it can be removed and substituted by a line segment. The cyclic groups may be obtained as rotation symmetries of polygons, monogon Demihypercube Herbert Busemann, The geometry of geodesics. New York, Academic Press,1955 Coxeter, Regular Polytopes, Dover Publications Inc,1973 ISBN 0-486-61480-8 Weisstein, a. B. Ivanov, Digon, in Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4 Media related to Digons at Wikimedia Commons
35.
Triangle
–
A triangle is a polygon with three edges and three vertices. It is one of the shapes in geometry. A triangle with vertices A, B, and C is denoted △ A B C, in Euclidean geometry any three points, when non-collinear, determine a unique triangle and a unique plane. This article is about triangles in Euclidean geometry except where otherwise noted, triangles can be classified according to the lengths of their sides, An equilateral triangle has all sides the same length. An equilateral triangle is also a polygon with all angles measuring 60°. An isosceles triangle has two sides of equal length, some mathematicians define an isosceles triangle to have exactly two equal sides, whereas others define an isosceles triangle as one with at least two equal sides. The latter definition would make all equilateral triangles isosceles triangles, the 45–45–90 right triangle, which appears in the tetrakis square tiling, is isosceles. A scalene triangle has all its sides of different lengths, equivalently, it has all angles of different measure. Hatch marks, also called tick marks, are used in diagrams of triangles, a side can be marked with a pattern of ticks, short line segments in the form of tally marks, two sides have equal lengths if they are both marked with the same pattern. In a triangle, the pattern is no more than 3 ticks. Similarly, patterns of 1,2, or 3 concentric arcs inside the angles are used to indicate equal angles, triangles can also be classified according to their internal angles, measured here in degrees. A right triangle has one of its interior angles measuring 90°, the side opposite to the right angle is the hypotenuse, the longest side of the triangle. The other two sides are called the legs or catheti of the triangle, special right triangles are right triangles with additional properties that make calculations involving them easier. One of the two most famous is the 3–4–5 right triangle, where 32 +42 =52, in this situation,3,4, and 5 are a Pythagorean triple. The other one is a triangle that has 2 angles that each measure 45 degrees. Triangles that do not have an angle measuring 90° are called oblique triangles, a triangle with all interior angles measuring less than 90° is an acute triangle or acute-angled triangle. If c is the length of the longest side, then a2 + b2 > c2, a triangle with one interior angle measuring more than 90° is an obtuse triangle or obtuse-angled triangle. If c is the length of the longest side, then a2 + b2 < c2, a triangle with an interior angle of 180° is degenerate
36.
Equilateral triangle
–
In geometry, an equilateral triangle is a triangle in which all three sides are equal. In the familiar Euclidean geometry, equilateral triangles are also equiangular and they are regular polygons, and can therefore also be referred to as regular triangles. Thus these are properties that are unique to equilateral triangles, the three medians have equal lengths. The three angle bisectors have equal lengths, every triangle center of an equilateral triangle coincides with its centroid, which implies that the equilateral triangle is the only triangle with no Euler line connecting some of the centers. For some pairs of triangle centers, the fact that they coincide is enough to ensure that the triangle is equilateral, in particular, A triangle is equilateral if any two of the circumcenter, incenter, centroid, or orthocenter coincide. It is also equilateral if its circumcenter coincides with the Nagel point, for any triangle, the three medians partition the triangle into six smaller triangles. A triangle is equilateral if and only if any three of the triangles have either the same perimeter or the same inradius. A triangle is equilateral if and only if the circumcenters of any three of the triangles have the same distance from the centroid. Morleys trisector theorem states that, in any triangle, the three points of intersection of the adjacent angle trisectors form an equilateral triangle, a version of the isoperimetric inequality for triangles states that the triangle of greatest area among all those with a given perimeter is equilateral. That is, PA, PB, and PC satisfy the inequality that any two of them sum to at least as great as the third. By Eulers inequality, the triangle has the smallest ratio R/r of the circumradius to the inradius of any triangle, specifically. The triangle of largest area of all those inscribed in a circle is equilateral. The ratio of the area of the incircle to the area of an equilateral triangle, the ratio of the area to the square of the perimeter of an equilateral triangle,1123, is larger than that for any other triangle. If a segment splits an equilateral triangle into two regions with equal perimeters and with areas A1 and A2, then 79 ≤ A1 A2 ≤97, in no other triangle is there a point for which this ratio is as small as 2. For any point P in the plane, with p, q, and t from the vertices A, B. For any point P on the circle of an equilateral triangle, with distances p, q. There are numerous triangle inequalities that hold with equality if and only if the triangle is equilateral, an equilateral triangle is the most symmetrical triangle, having 3 lines of reflection and rotational symmetry of order 3 about its center. Its symmetry group is the group of order 6 D3
37.
Isosceles triangle
–
In geometry, an isosceles triangle is a triangle that has two sides of equal length. By the isosceles triangle theorem, the two angles opposite the sides are themselves equal, while if the third side is different then the third angle is different. By the Steiner–Lehmus theorem, every triangle with two angle bisectors of equal length is isosceles, in an isosceles triangle that has exactly two equal sides, the equal sides are called legs and the third side is called the base. The angle included by the legs is called the vertex angle, the vertex opposite the base is called the apex. In the equilateral triangle case, since all sides are equal, any side can be called the base, if needed, and the term leg is not generally used. A triangle with two equal sides has exactly one axis of symmetry, which goes through the vertex angle. Thus the axis of symmetry coincides with the bisector of the vertex angle, the median drawn to the base, the altitude drawn from the vertex angle. Whether the isosceles triangle is acute, right or obtuse depends on the vertex angle, in Euclidean geometry, the base angles cannot be obtuse or right because their measures would sum to at least 180°, the total of all angles in any Euclidean triangle. The Euler line of any triangle goes through the orthocenter, its centroid. In an isosceles triangle with two equal sides, the Euler line coincides with the axis of symmetry. This can be seen as follows, if the vertex angle is acute, then the orthocenter, the centroid, and the circumcenter all fall inside the triangle. In an isosceles triangle the incenter lies on the Euler line, the Steiner inellipse of any triangle is the unique ellipse that is internally tangent to the triangles three sides at their midpoints. For any isosceles triangle with area T and perimeter p, we have 2 p b 3 − p 2 b 2 +16 T2 =0. By substituting the height, the formula for the area of a triangle can be derived from the general formula one-half the base times the height. This is what Herons formula reduces to in the isosceles case, if the apex angle and leg lengths of an isosceles triangle are known, then the area of that triangle is, T =2 = a 2 sin cos . This is derived by drawing a line from the base of the triangle. The bases of two right triangles are both equal to the hypotenuse times the sine of the bisected angle by definition of the term sine. For the same reason, the heights of these triangles are equal to the times the cosine of the bisected angle
38.
Quadrilateral
–
In Euclidean plane geometry, a quadrilateral is a polygon with four edges and four vertices or corners. Sometimes, the quadrangle is used, by analogy with triangle. The origin of the quadrilateral is the two Latin words quadri, a variant of four, and latus, meaning side. Quadrilaterals are simple or complex, also called crossed, simple quadrilaterals are either convex or concave. The interior angles of a simple quadrilateral ABCD add up to 360 degrees of arc and this is a special case of the n-gon interior angle sum formula × 180°. All non-self-crossing quadrilaterals tile the plane by repeated rotation around the midpoints of their edges, any quadrilateral that is not self-intersecting is a simple quadrilateral. In a convex quadrilateral, all angles are less than 180°. Irregular quadrilateral or trapezium, no sides are parallel, trapezium or trapezoid, at least one pair of opposite sides are parallel. Isosceles trapezium or isosceles trapezoid, one pair of sides are parallel. Alternative definitions are a quadrilateral with an axis of symmetry bisecting one pair of opposite sides, parallelogram, a quadrilateral with two pairs of parallel sides. Equivalent conditions are that opposite sides are of length, that opposite angles are equal. In other words, parallelograms include all rhombi and all rhomboids, rhombus or rhomb, all four sides are of equal length. An equivalent condition is that the diagonals bisect each other. Rhomboid, a parallelogram in which adjacent sides are of unequal lengths, not all references agree, some define a rhomboid as a parallelogram which is not a rhombus. Rectangle, all four angles are right angles, an equivalent condition is that the diagonals bisect each other and are equal in length. Square, all four sides are of length, and all four angles are right angles. An equivalent condition is that opposite sides are parallel, that the diagonals bisect each other. A quadrilateral is a if and only if it is both a rhombus and a rectangle
39.
Square
–
In geometry, a square is a regular quadrilateral, which means that it has four equal sides and four equal angles. It can also be defined as a rectangle in which two adjacent sides have equal length, a square with vertices ABCD would be denoted ◻ ABCD. e. A rhombus with equal diagonals a convex quadrilateral with sides a, b, c, d whose area is A =12 =12. Opposite sides of a square are both parallel and equal in length, all four angles of a square are equal. All four sides of a square are equal, the diagonals of a square are equal. The square is the n=2 case of the families of n-hypercubes and n-orthoplexes, a truncated square, t, is an octagon. An alternated square, h, is a digon, the perimeter of a square whose four sides have length ℓ is P =4 ℓ and the area A is A = ℓ2. In classical times, the power was described in terms of the area of a square. This led to the use of the square to mean raising to the second power. The area can also be calculated using the diagonal d according to A = d 22. In terms of the circumradius R, the area of a square is A =2 R2, since the area of the circle is π R2, in terms of the inradius r, the area of the square is A =4 r 2. Because it is a polygon, a square is the quadrilateral of least perimeter enclosing a given area. Dually, a square is the quadrilateral containing the largest area within a given perimeter. Indeed, if A and P are the area and perimeter enclosed by a quadrilateral, then the isoperimetric inequality holds,16 A ≤ P2 with equality if. The diagonals of a square are 2 times the length of a side of the square and this value, known as the square root of 2 or Pythagoras constant, was the first number proven to be irrational. A square can also be defined as a parallelogram with equal diagonals that bisect the angles, if a figure is both a rectangle and a rhombus, then it is a square. If a circle is circumscribed around a square, the area of the circle is π /2 times the area of the square, if a circle is inscribed in the square, the area of the circle is π /4 times the area of the square. A square has an area than any other quadrilateral with the same perimeter
40.
Rectangle
–
In Euclidean plane geometry, a rectangle is a quadrilateral with four right angles. It can also be defined as a quadrilateral, since equiangular means that all of its angles are equal. It can also be defined as a parallelogram containing a right angle, a rectangle with four sides of equal length is a square. The term oblong is occasionally used to refer to a non-square rectangle, a rectangle with vertices ABCD would be denoted as ABCD. The word rectangle comes from the Latin rectangulus, which is a combination of rectus and angulus, a crossed rectangle is a crossed quadrilateral which consists of two opposite sides of a rectangle along with the two diagonals. It is a case of an antiparallelogram, and its angles are not right angles. Other geometries, such as spherical, elliptic, and hyperbolic, have so-called rectangles with sides equal in length. Rectangles are involved in many tiling problems, such as tiling the plane by rectangles or tiling a rectangle by polygons, a convex quadrilateral with successive sides a, b, c, d whose area is 12. A rectangle is a case of a parallelogram in which each pair of adjacent sides is perpendicular. A parallelogram is a case of a trapezium in which both pairs of opposite sides are parallel and equal in length. A trapezium is a quadrilateral which has at least one pair of parallel opposite sides. A convex quadrilateral is Simple, The boundary does not cross itself, star-shaped, The whole interior is visible from a single point, without crossing any edge. De Villiers defines a more generally as any quadrilateral with axes of symmetry through each pair of opposite sides. This definition includes both right-angled rectangles and crossed rectangles, quadrilaterals with two axes of symmetry, each through a pair of opposite sides, belong to the larger class of quadrilaterals with at least one axis of symmetry through a pair of opposite sides. These quadrilaterals comprise isosceles trapezia and crossed isosceles trapezia, a rectangle is cyclic, all corners lie on a single circle. It is equiangular, all its corner angles are equal and it is isogonal or vertex-transitive, all corners lie within the same symmetry orbit. It has two lines of symmetry and rotational symmetry of order 2. The dual polygon of a rectangle is a rhombus, as shown in the table below, the figure formed by joining, in order, the midpoints of the sides of a rectangle is a rhombus and vice versa
41.
Rhombus
–
In Euclidean geometry, a rhombus is a simple quadrilateral whose four sides all have the same length. Another name is equilateral quadrilateral, since equilateral means that all of its sides are equal in length, every rhombus is a parallelogram and a kite. A rhombus with right angles is a square, the word rhombus comes from Greek ῥόμβος, meaning something that spins, which derives from the verb ῥέμβω, meaning to turn round and round. The word was used both by Euclid and Archimedes, who used the term solid rhombus for two right circular cones sharing a common base, the surface we refer to as rhombus today is a cross section of this solid rhombus through the apex of each of the two cones. This is a case of the superellipse, with exponent 1. Every rhombus has two diagonals connecting pairs of vertices, and two pairs of parallel sides. Using congruent triangles, one can prove that the rhombus is symmetric across each of these diagonals and it follows that any rhombus has the following properties, Opposite angles of a rhombus have equal measure. The two diagonals of a rhombus are perpendicular, that is, a rhombus is an orthodiagonal quadrilateral, the first property implies that every rhombus is a parallelogram. Thus denoting the common side as a and the diagonals as p and q, not every parallelogram is a rhombus, though any parallelogram with perpendicular diagonals is a rhombus. In general, any quadrilateral with perpendicular diagonals, one of which is a line of symmetry, is a kite, every rhombus is a kite, and any quadrilateral that is both a kite and parallelogram is a rhombus. A rhombus is a tangential quadrilateral and that is, it has an inscribed circle that is tangent to all four sides. As for all parallelograms, the area K of a rhombus is the product of its base, the base is simply any side length a, K = a ⋅ h. The inradius, denoted by r, can be expressed in terms of the p and q as. The dual polygon of a rhombus is a rectangle, A rhombus has all sides equal, a rhombus has opposite angles equal, while a rectangle has opposite sides equal. A rhombus has a circle, while a rectangle has a circumcircle. A rhombus has an axis of symmetry through each pair of opposite vertex angles, the diagonals of a rhombus intersect at equal angles, while the diagonals of a rectangle are equal in length. The figure formed by joining the midpoints of the sides of a rhombus is a rectangle, a rhombohedron is a three-dimensional figure like a cube, except that its six faces are rhombi instead of squares. The rhombic dodecahedron is a polyhedron with 12 congruent rhombi as its faces
42.
Parallelogram
–
In Euclidean geometry, a parallelogram is a simple quadrilateral with two pairs of parallel sides. The opposite or facing sides of a parallelogram are of equal length, by comparison, a quadrilateral with just one pair of parallel sides is a trapezoid in American English or a trapezium in British English. The three-dimensional counterpart of a parallelogram is a parallelepiped, rhomboid – A quadrilateral whose opposite sides are parallel and adjacent sides are unequal, and whose angles are not right angles Rectangle – A parallelogram with four angles of equal size. Rhombus – A parallelogram with four sides of equal length, square – A parallelogram with four sides of equal length and angles of equal size. A simple quadrilateral is a if and only if any one of the following statements is true. Two pairs of opposite angles are equal in measure, one pair of opposite sides are parallel and equal in length. Each diagonal divides the quadrilateral into two congruent triangles, the sum of the squares of the sides equals the sum of the squares of the diagonals. It has rotational symmetry of order 2, the sum of the distances from any interior point to the sides is independent of the location of the point. Thus all parallelograms have all the properties listed above, and conversely, if just one of statements is true in a simple quadrilateral. Opposite sides of a parallelogram are parallel and so will never intersect, the area of a parallelogram is twice the area of a triangle created by one of its diagonals. The area of a parallelogram is also equal to the magnitude of the cross product of two adjacent sides. Any line through the midpoint of a parallelogram bisects the area, any non-degenerate affine transformation takes a parallelogram to another parallelogram. A parallelogram has rotational symmetry of order 2, if it also has exactly two lines of reflectional symmetry then it must be a rhombus or an oblong. If it has four lines of symmetry, it is a square. The perimeter of a parallelogram is 2 where a and b are the lengths of adjacent sides, unlike any other convex polygon, a parallelogram cannot be inscribed in any triangle with less than twice its area. The centers of four squares all constructed either internally or externally on the sides of a parallelogram are the vertices of a square. If two lines parallel to sides of a parallelogram are constructed concurrent to a diagonal, then the parallelograms formed on opposite sides of that diagonal are equal in area, the diagonals of a parallelogram divide it into four triangles of equal area. All of the formulas for general convex quadrilaterals apply to parallelograms