enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Rhind Mathematical Papyrus - Wikipedia

   en.wikipedia.org/wiki/Rhind_Mathematical_Papyrus

   Problems 1–6 compute divisions of a certain number of loaves of bread by 10 men and record the outcome in unit fractions. Problems 7–20 show how to multiply the expressions 1 + 1/2 + 1/4 = 7/4, and 1 + 2/3 + 1/3 = 2 by different fractions. Problems 21–23 are problems in completion, which in modern notation are simply subtraction problems.

3. Packing problems - Wikipedia

   en.wikipedia.org/wiki/Packing_problems

   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.

4. Circle packing in a circle - Wikipedia

   en.wikipedia.org/wiki/Circle_packing_in_a_circle

   Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible ... solutions for n = 2, 3, 4, 7

5. Collatz conjecture - Wikipedia

   en.wikipedia.org/wiki/Collatz_conjecture

   For any integer n, n ≡ 1 (mod 2) if and only if 3n + 1 ≡ 4 (mod 6). Equivalently, ⁠ n − 1 / 3 ⁠ ≡ 1 (mod 2) if and only if n ≡ 4 (mod 6). Conjecturally, this inverse relation forms a tree except for the 1–2–4 loop (the inverse of the 4–2–1 loop of the unaltered function f defined in the Statement of the problem section of ...

6. Circle packing - Wikipedia

   en.wikipedia.org/wiki/Circle_packing

   A compact binary circle packing with the most similarly sized circles possible. [7] It is also the densest possible packing of discs with this size ratio (ratio of 0.6375559772 with packing fraction (area density) of 0.910683). [8] There are also a range of problems which permit the sizes of the circles to be non-uniform.

7. Square packing - Wikipedia

   en.wikipedia.org/wiki/Square_packing

   Square packing in a square is the problem of determining the maximum number of unit squares (squares of side length one) that can be packed inside a larger square of side length . If is an integer, the answer is but the precise – or even asymptotic – amount of unfilled space for an arbitrary non-integer is an open question. [1] The smallest ...

8. Sphere packing - Wikipedia

   en.wikipedia.org/wiki/Sphere_packing

   Sphere packing finds practical application in the stacking of cannonballs. In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three- dimensional Euclidean space. However, sphere packing problems can be ...

9. Ancient Egyptian mathematics - Wikipedia

   en.wikipedia.org/wiki/Ancient_Egyptian_mathematics

   Ancient Egyptian mathematics is the mathematics that was developed and used in Ancient Egypt c. 3000 to c. 300 BCE, from the Old Kingdom of Egypt until roughly the beginning of Hellenistic Egypt. The ancient Egyptians utilized a numeral system for counting and solving written mathematical problems, often involving multiplication and fractions.