To count clean triangles we count on $imph(n)$
Combinatorics
2020-12-22 v1
Abstract
A clean lattice triangle in 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 (imitation phi).
Cite
@article{arxiv.2012.11081,
title = {To count clean triangles we count on $imph(n)$},
author = {Mizan R. Khan and Riaz R. Khan},
journal= {arXiv preprint arXiv:2012.11081},
year = {2020}
}