#### Vol. 14, No. 2, 2021

 Recent Issues
 The Journal About the Journal Editorial Board Editors’ Interests Subscriptions Submission Guidelines Submission Form Policies for Authors Ethics Statement ISSN: 1944-4184 (e-only) ISSN: 1944-4176 (print) Author Index Coming Soon Other MSP Journals
New methods to find patches of invisible integer lattice points

### Austin Goodrich, aBa Mbirika and Jasmine Nielsen

Vol. 14 (2021), No. 2, 283–310
##### Abstract

It is a surprising fact that the proportion of integer lattice points visible from the origin is exactly $6∕{\pi }^{2}$, or approximately 60%. Hence, approximately 40% of the integer lattice is hidden from the origin. Since 1971, many have studied a variety of problems involving lattice-point visibility, in particular, searching for patterns in that 40% of the lattice composed of invisible points. One such pattern is a square patch, an $n×n$ grid of ${n}^{2}$ invisible points, which we call a hidden forest. It is known that there exist arbitrarily large hidden forests in the integer lattice. However, the methods up to now involve the Chinese remainder theorem (CRT) on the rows and columns of matrices with prime number entries, and they have only been able to locate hidden forests very far from the origin. For example, using this method the closest known $4×4$ hidden forest is over 3 quintillion, or $3×1{0}^{18}$, units away from the origin. We introduce the concept of quasiprime matrices and utilize a variety of computational and theoretical techniques to find some of the closest known hidden forests to date. Using these new techniques, we find a $4×4$ hidden forest that is merely 184 million units away from the origin. We conjecture that every hidden forest can be found via the CRT-algorithm on a quasiprime matrix.

However, your active subscription may be available on Project Euclid at
https://projecteuclid.org/involve

We have not been able to recognize your IP address 54.227.97.219 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

or by using our contact form.

##### Keywords
lattice-point visibility, Chinese remainder theorem, number theory
Primary: 11P21
Secondary: 11Y99

Java Code