Search results
Results from the WOW.Com Content Network
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.
In 1946, Stanislaw Ulam asked whether there exists a set of points at rational distances from each other that forms a dense subset of the Euclidean plane. [2] While the answer to this question is still open, József Solymosi and Frank de Zeeuw showed that the only irreducible algebraic curves that contain infinitely many points at rational distances are lines and circles. [3]
Consider a solution circle of radius r s and three given circles of radii r 1, r 2 and r 3. If the solution circle is externally tangent to all three given circles, the distances between the center of the solution circle and the centers of the given circles equal d 1 = r 1 + r s, d 2 = r 2 + r s and d 3 = r 3 + r s, respectively.
For division to always yield one number rather than an integer quotient plus a remainder, the natural numbers must be extended to rational numbers or real numbers. In these enlarged number systems, division is the inverse operation to multiplication, that is a = c / b means a × b = c, as long as b is not zero.
The monkey and the coconuts is the best known representative of a class of puzzle problems requiring integer solutions structured as recursive division or fractionating of some discretely divisible quantity, with or without remainders, and a final division into some number of equal parts, possibly with a remainder.
Depending on whether the solution circle is increased or decreased in radii, the two given lines are displaced parallel to themselves by the same amount, depending on which quadrant the center of the solution circle falls. This shrinking of the given circle to a point reduces the problem to the PLL problem, solved above.
Malfatti's assumption that the two problems are equivalent is incorrect. Lob and Richmond (), who went back to the original Italian text, observed that for some triangles a larger area can be achieved by a greedy algorithm that inscribes a single circle of maximal radius within the triangle, inscribes a second circle within one of the three remaining corners of the triangle, the one with the ...
Rational number arithmetic is the branch of arithmetic that deals with the manipulation of numbers that can be expressed as a ratio of two integers. [93] Most arithmetic operations on rational numbers can be calculated by performing a series of integer arithmetic operations on the numerators and the denominators of the involved numbers.