Arbitrarily Large Regions of Invisible Integer Lattice Points
| dc.contributor.advisor | Mbirika, aBa | |
| dc.contributor.author | Nielsen, Jasmine | |
| dc.contributor.author | Goodrich, Austin | |
| dc.date.accessioned | 2015-04-30T19:07:27Z | |
| dc.date.available | 2015-04-30T19:07:27Z | |
| dc.date.issued | 2014-04 | |
| dc.description | Color poster with text, graphs, and models. | en |
| dc.description.abstract | Can one find arbitrarily large squares or cubes of integer lattice points in which every point is not visible from the origin? The answer is yes; we call these invisible regions "hidden (or invisible) forests." We believe that the CRT can predict the closest forests by permuting the prime matrix entries. | en |
| dc.description.sponsorship | University of Wisconsin--Eau Claire Office of Research and Sponsored Programs. | en |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/72058 | |
| dc.language.iso | en_US | en |
| dc.relation.ispartofseries | USGZE AS589 | en |
| dc.subject | Lattice points | en |
| dc.subject | Integers | en |
| dc.subject | Chinese Remainder Theorem (CRT) | en |
| dc.subject | Posters | en |
| dc.title | Arbitrarily Large Regions of Invisible Integer Lattice Points | en |
| dc.type | Presentation | en |