Sequences of integers with missing quotients and dense points without neighbors

It is known that in the case A={p,q}, where p, q are coprime integers greater than 1, the latter problem is reduced to the evaluation of the largest number of non-adjacent lattice points in a triangle whose legs lie on the coordinate axes. We prove that this number is achieved by choosing points of the same color in the checkerboard coloring.