论文标题
为了计算干净的三角形，我们依靠$ imph（n）$
To count clean triangles we count on $imph(n)$
论文作者
论文摘要
$ {\ mathbb r}^2 $中的干净晶格三角形是一个三角形，其两侧没有任何晶格点以外的其他晶格点。本文的核心目的是计算给定区域的清洁三角形数量，直至单型等效。为此，我们使用了Euler Phi功能的变体，我们称之为$ imph（n）$（模仿phi）。
A clean lattice triangle in ${\mathbb R}^2$ is a triangle that does not contain any lattice points on its sides other than its vertices. The central goal of this paper is to count the number of clean triangles of a given area up to unimodular equivalence. In doing so we use a variant of the Euler phi function which we call $imph(n)$ (imitation phi).
