Problem A. 762. (November 2019)

A. 762. In a forest there are \(\displaystyle n\) different trees (considered as points), no three of which lie on the same line. John takes photographs of the forest such that all trees are visible (and no two trees are behind each other). What is the largest number of orders of in which the trees that can appear on the photos?

Proposed by Gábor Mészáros, Sunnyvale, Kalifornia

(7 pont)

Deadline expired on December 10, 2019.

Statistics:

12 students sent a solution.
7 points:	Beke Csongor, Weisz Máté.
6 points:	Hegedűs Dániel, Várkonyi Zsombor.
5 points:	3 students.
4 points:	1 student.
1 point:	2 students.
0 point:	2 students.

Problems in Mathematics of KöMaL, November 2019