Search results
Results from the WOW.Com Content Network
The Basel problem is a problem in mathematical analysis with relevance to number theory, concerning an infinite sum of inverse squares.It was first posed by Pietro Mengoli in 1650 and solved by Leonhard Euler in 1734, [1] and read on 5 December 1735 in The Saint Petersburg Academy of Sciences. [2]
Inscribe a square in the circle, so that its four corners lie on the circle. Between the square and the circle are four segments. If the total area of those gaps, G 4, is greater than E, split each arc in half. This makes the inscribed square into an inscribed octagon, and produces eight segments with a smaller total gap, G 8.
(1/4, 1/2) asymmetric Cantor set: Built by removing the second quarter at each iteration. [4] ... Built by exchanging iteratively each square by a cross of 5 squares.
where C is the circumference of a circle, d is the diameter, and r is the radius.More generally, = where L and w are, respectively, the perimeter and the width of any curve of constant width.
If exponentiation is considered as a multivalued function then the possible values of (−1 ⋅ −1) 1/2 are {1, −1}. The identity holds, but saying {1} = {(−1 ⋅ −1) 1/2 } is incorrect. The identity ( e x ) y = e xy holds for real numbers x and y , but assuming its truth for complex numbers leads to the following paradox , discovered ...
First six summands drawn as portions of a square. The geometric series on the real line. In mathematics, the infinite series 1 / 2 + 1 / 4 + 1 / 8 + 1 / 16 + ··· is an elementary example of a geometric series that converges absolutely. The sum of the series is 1. In summation notation, this may be expressed as
Likewise, the second largest black square has area 1 / 16 , and the third largest black square has area 1 / 64 . The area taken up by all of the black squares together is therefore 1 / 4 + 1 / 16 + 1 / 64 + ⋯ , and this is also the area taken up by the gray squares and the white squares.
Square packing in a circle is a related problem of packing n unit squares into a circle with radius as small as possible. For this problem, good solutions are known for n up to 35. Here are the minimum known solutions for up to n = 12 {\displaystyle n=12} (although only the cases n = 1 {\displaystyle n=1} and n = 2 {\displaystyle n=2} are known ...