格点凸多边形内含格点最少的问题是一较为困难的问题．对3≤，n≤8，问题已获解决，见文［1］、［2」．本文将对格点九（十）边形内含最少格点情况，及任意格来凸n边形的内含格来最少的的构图与面积作初步探讨．引理（i）格点凸五边形若某边上有4个格点，则真内至少含2个格点； The problem of the least number of lattice points contained in a lattice convex polygon is a more difficult problem. For 3 ≤, n ≤ 8, the problem has been solved, see text [1], [2]. In this paper, the minimum number of lattice points in the nine (ten) lattice, and the minimum number of compositions and areas of the arbitrary lattice convex lattice are discussed. Lemma (i) Lattice Convex pentagons If there are 4 lattice points on an edge, the truth contains at least 2 lattice points;