enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Area of a circle - Wikipedia

    en.wikipedia.org/wiki/Area_of_a_circle

    Suppose that the area C enclosed by the circle is greater than the area T = cr/2 of the triangle. Let E denote the excess amount. 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

  3. Bertrand paradox (probability) - Wikipedia

    en.wikipedia.org/wiki/Bertrand_paradox_(probability)

    The chord is longer than a side of the inscribed triangle if the chosen point falls within a concentric circle of radius ⁠ 1 / 2 ⁠ the radius of the larger circle. The area of the smaller circle is one fourth the area of the larger circle, therefore the probability a random chord is longer than a side of the inscribed triangle is ⁠ 1 / 4 ⁠.

  4. Aristotle's wheel paradox - Wikipedia

    en.wikipedia.org/wiki/Aristotle's_wheel_paradox

    If the smaller circle depends on the larger one (Case I), the larger circle's motion forces the smaller to traverse the larger’s circumference. If the larger circle depends on the smaller one (Case II), then the smaller circle's motion forces the larger circle to traverse the smaller circle’s circumference. This is the simplest solution.

  5. Dividing a circle into areas - Wikipedia

    en.wikipedia.org/wiki/Dividing_a_circle_into_areas

    The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.

  6. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    Gauss's circle problem asks how many points there are inside this circle of the form (,) where and are both integers. Since the equation of this circle is given in Cartesian coordinates by x 2 + y 2 = r 2 {\displaystyle x^{2}+y^{2}=r^{2}} , the question is equivalently asking how many pairs of integers m and n there are such that

  7. Roundness - Wikipedia

    en.wikipedia.org/wiki/Roundness

    Roundness = ⁠ Perimeter 2 / 4 π × Area ⁠. This ratio will be 1 for a circle and greater than 1 for non-circular shapes. Another definition is the inverse of that: Roundness = ⁠ 4 π × Area / Perimeter 2 ⁠, which is 1 for a perfect circle and goes down as far as 0 for highly non-circular shapes.

  8. Missing square puzzle - Wikipedia

    en.wikipedia.org/wiki/Missing_square_puzzle

    The apparent paradox is explained by the fact that the side of the new large square is a little smaller than the original one. If θ is the angle between two opposing sides in each quadrilateral, then the ratio of the two areas is given by sec 2 θ. For θ = 5°, this is approximately 1.00765, which corresponds to a difference of about 0.8%.

  9. Circle - Wikipedia

    en.wikipedia.org/wiki/Circle

    Apollonius' definition of a circle: d 1 /d 2 constant. Apollonius of Perga showed that a circle may also be defined as the set of points in a plane having a constant ratio (other than 1) of distances to two fixed foci, A and B. [16] [17] (The set of points where the distances are equal is the perpendicular bisector of segment AB, a line.)