Search results
Results From The WOW.Com Content Network
Square triangular number 36 depicted as a triangular number and as a square number. In mathematics, a square triangular number (or triangular square number) is a number which is both a triangular number and a square number. There are infinitely many square triangular numbers; the first few are:
A square whose side length is a triangular number can be partitioned into squares and half-squares whose areas add to cubes. From Gulley (2010).The n th coloured region shows n squares of dimension n by n (the rectangle is 1 evenly divided square), hence the area of the n th region is n times n × n.
Geometric representation of the square pyramidal number 1 + 4 + 9 + 16 = 30. A pyramidal number is the number of points in a pyramid with a polygonal base and triangular sides. [1] The term often refers to square pyramidal numbers, which have a square base with four sides, but it can also refer to a pyramid with any number of sides. [2]
Squaring an integer, or taking the area of a square with integer sides, results in a square number; these are figurate numbers representing the numbers of points that can be arranged into a square grid. [10] Since four squared equals sixteen, a four by four square has an area equal to its perimeter. That is, it is an equable shape. The only ...
Other methods also exist for describing polygonal tilings. When the tessellation is made of regular polygons, the most common notation is the vertex configuration, which is simply a list of the number of sides of the polygons around a vertex. The square tiling has a vertex configuration of 4.4.4.4, or 4 4.
Polyforms based on isosceles right triangles, with sides in the ratio 1 : 1 : √ 2, are known as polyabolos. An infinite number of them are rep-tiles. An infinite number of them are rep-tiles. Indeed, the simplest of all rep-tiles is a single isosceles right triangle.
A 6-equidissection of a square. In geometry, an equidissection is a partition of a polygon into triangles of equal area. The study of equidissections began in the late 1960s with Monsky's theorem, which states that a square cannot be equidissected into an odd number of triangles. [1] In fact, most polygons cannot be equidissected at all. [2]
The segments of a closed polygonal chain are called its edges or sides. The points where two edges meet are the polygon's vertices or corners. An n-gon is a polygon with n sides; for example, a triangle is a 3-gon. A simple polygon is one which does not intersect itself. More precisely, the only allowed intersections among the line segments ...