About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 109. Chapters: Euclidean geometry, Works by Euclid, Euclidean algorithm, Euclidean space, Extended Euclidean algorithm, Rotation, Euclidean domain, Congruence, Plane, Similarity, Hyperplane, Radio navigation, Euclid's Elements, Gyrovector space, Root system, Euclidean subspace, Multilateration, Triangulation, Homothetic center, Crystal system, Orientation, Triangle group, Intercept theorem, One-dimensional symmetry group, Rodrigues' rotation formula, Book of Lemmas, Trilateration, Isosceles triangle theorem, Curve of constant width, Screw axis, Method of exhaustion, Parallelogram law, Sangaku, Euclid's Optics, Line-plane intersection, Vertex, Alignments of random points, Casey's theorem, Cauchy's theorem, Rotation of axes, Abouabdillah's theorem, Measurement of a Circle, Equal incircles theorem, Expansion, Jung's theorem, On Spirals, Flat, On the Sphere and Cylinder, Orthographic projection, Square lattice, Disk, Orthant, Point on plane closest to origin, Varignon's theorem, Steiner-Lehmus theorem, Star domain, Apollonius' theorem, Half-space, Triangle postulate, Intersection of a polyhedron with a line, Simple polytope, Integer lattice, Simplicial polytope, Milman's reverse Brunn-Minkowski inequality, De Gua's theorem, Busemann's theorem, Cevian, Hadwiger-Finsler inequality, Hiroshi Haruki, Equiangular lines, Distance from a point to a line, Cleonides, British flag theorem, Dissection problem, Pendent, Data, Euclidean relation, Plane symmetry, Peak, Saccheri-Legendre theorem, Beckman-Quarles theorem, Vertex angle, Gyration, Coincident, Ortsbogen theorem, Anthropomorphic polygon, Schiffler's theorem, Proclo, Maximum-margin hyperplane. Excerpt: In mathematics, the Euclidean algorithm (also called Euclid's algorithm) is an efficient method for computing the greatest common divisor (GCD), also known as the greatest common factor (GC...
