Let $1 < c < 2$. For m, n ∈ N, a lattice point $(m, n)$ is powerful if and only if (m, n) is a powerful number, where (*, *) is the greatest common divisor function. In this paper, we count the number of the ordered pairs $(m, n)$, m, n ≤ x such that the lattice point ( mᶜ , nᶜ ) is powerful. Moreover, we study r-free lattice points analogues of powerful lattice points.
No takes yet. Share an insight, caveat, or question.
Srisopha et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: