Ad
related to: radius problems with answers
Search results
Results From The WOW.Com Content Network
The proton radius puzzle is an unanswered problem in physics relating to the size of the proton. [1] Historically the proton charge radius was measured by two independent methods, which converged to a value of about 0.877 femtometres (1 fm = 10 −15 m).
The answer to the problem as proposed was given in the 1749 issue of the magazine by a Mr. Heath, and stated as 76,257.86 sq.yds. which was arrived at partly by "trial and a table of logarithms". The answer is not so accurate as the number of digits of precision would suggest. No analytical solution was provided.
This problem is known as the primitive circle problem, as it involves searching for primitive solutions to the original circle problem. [9] It can be intuitively understood as the question of how many trees within a distance of r are visible in the Euclid's orchard , standing in the origin.
the inverse geodesic problem or second geodesic problem, given A and B, determine s 12, α 1, and α 2. As can be seen from Fig. 1, these problems involve solving the triangle NAB given one angle, α 1 for the direct problem and λ 12 = λ 2 − λ 1 for the inverse problem, and its two adjacent sides.
The outer coin makes two rotations rolling once around the inner coin. The path of a single point on the edge of the moving coin is a cardioid.. The coin rotation paradox is the counter-intuitive math problem that, when one coin is rolled around the rim of another coin of equal size, the moving coin completes not one but two full rotations after going all the way around the stationary coin ...
The Schwarzschild radius was named after the German astronomer Karl Schwarzschild, who calculated this exact solution for the theory of general relativity in 1916. The Schwarzschild radius is given as =, where G is the gravitational constant, M is the object mass, and c is the speed of light.
Some instances of the smallest bounding circle. The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing circle problem) is a computational geometry problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane.
The hexagonal packing of circles on a 2-dimensional Euclidean plane. These problems are mathematically distinct from the ideas in the circle packing theorem.The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere.