Euclid's orchard

From testwiki
Revision as of 02:42, 12 August 2023 by imported>Fadesga (External links)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Distinguish

Plan view of one corner of Euclid's orchard, in which trees are labelled with the x co-ordinate of their projection on the plane Template:Math.

In mathematics, informally speaking, Euclid's orchard is an array of one-dimensional "trees" of unit height planted at the lattice points in one quadrant of a square lattice.[1] More formally, Euclid's orchard is the set of line segments from Template:Math to Template:Math, where Template:Mvar and Template:Mvar are positive integers.

One corner of Euclid's orchard, blue trees visible from the origin
Perspective view of Euclid's orchard from the origin. Red trees denote rows two off the main diagonal.

The trees visible from the origin are those at lattice points Template:Math, where Template:Mvar and Template:Mvar are coprime, i.e., where the fraction Template:Math is in reduced form. The name Euclid's orchard is derived from the Euclidean algorithm.

If the orchard is projected relative to the origin onto the plane Template:Math (or, equivalently, drawn in perspective from a viewpoint at the origin) the tops of the trees form a graph of Thomae's function. The point Template:Math projects to

(xx+y,yx+y,1x+y).

The solution to the Basel problem can be used to show that the proportion of points in the Template:Tmath grid that have trees on them is approximately 6π2 and that the error of this approximation goes to zero in the limit as Template:Mvar goes to infinity.[2]

See also

References

Template:Reflist


Template:Math-hist-stub