Disk Covering Problem
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
payback
11 °P sammeln
  • Broschiertes Buch

High Quality Content by WIKIPEDIA articles! The disk covering problem was proposed by C. T. Zahn in 1962. Given an integer n, the problem asks for the smallest real number r(n) such that n disks of radius r(n) can be arranged in such a way as to cover the unit disk. In mathematics, the real numbers include both rational numbers, such as 42 and 23/129, and irrational numbers, such as pi and the square root of two; or, a real number can be given by an infinite decimal representation, such as 2.4871773339..., where the digits continue in some way; or, the real numbers may be thought of as points on an infinitely long number line.…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
High Quality Content by WIKIPEDIA articles! The disk covering problem was proposed by C. T. Zahn in 1962. Given an integer n, the problem asks for the smallest real number r(n) such that n disks of radius r(n) can be arranged in such a way as to cover the unit disk. In mathematics, the real numbers include both rational numbers, such as 42 and 23/129, and irrational numbers, such as pi and the square root of two; or, a real number can be given by an infinite decimal representation, such as 2.4871773339..., where the digits continue in some way; or, the real numbers may be thought of as points on an infinitely long number line.