Search results
Results from the WOW.Com Content Network
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.
Placing the point P on any of the four vertices of the rectangle yields the square of the diagonal of the rectangle being equal to the sum of the squares of the width and length of the rectangle, which is the Pythagorean theorem.
A square whose side length is a triangular number can be partitioned into squares and half-squares whose areas add to cubes. This shows that the square of the n th triangular number is equal to the sum of the first n cube numbers. Also, the square of the n th triangular number is the same as the sum of the cubes of the integers 1 to n.
In mathematics, a polygonal number is a number that counts dots arranged in the shape of a regular polygon [1]: 2-3 . These are one type of 2-dimensional figurate numbers . Polygonal numbers were first studied during the 6th century BC by the Ancient Greeks, who investigated and discussed properties of oblong , triangular , and square numbers ...
The area of an ellipse is proportional to a rectangle having sides equal to its major and minor axes; The volume of a sphere is 4 times that of a cone having a base of the same radius and height equal to this radius; The volume of a cylinder having a height equal to its diameter is 3/2 that of a sphere having the same diameter;
Since x 2 represents the area of a square with side of length x, and bx represents the area of a rectangle with sides b and x, the process of completing the square can be viewed as visual manipulation of rectangles. Simple attempts to combine the x 2 and the bx rectangles into a larger square result in a missing corner.
The lowest number of squares need for a perfect tiling of a rectangle is 9 [19] and the lowest number needed for a perfect tilling a square is 21, found in 1978 by computer search. [20] A rectangle has commensurable sides if and only if it is tileable by a finite number of unequal squares.
The sum of the squared distances from the vertices of a regular n-gon to any point on its circumcircle equals 2nR 2 where R is the circumradius. [4]: p. 73 The sum of the squared distances from the midpoints of the sides of a regular n-gon to any point on the circumcircle is 2nR 2 − 1 / 4 ns 2, where s is the side length and R is the ...