[Search for users]
[Overall Top Noters]
[List of all Conferences]
[Download this site]
| Title: | Mathematics at DEC |
|
| Moderator: | RUSURE::EDP |
|
| Created: | Mon Feb 03 1986 |
| Last Modified: | Fri Jun 06 1997 |
| Last Successful Update: | Fri Jun 06 1997 |
| Number of topics: | 2083 |
| Total number of notes: | 14613 |
351.0. "Visible Lattice points" by TOOLS::STAN () Thu Oct 17 1985 14:30
(Paul Erdos)
Consider the set of lattice points (x,y) with x and y integers.
Call a point visible if gcd(x,y)=1. The visible lattice points
define a graph, two points being joined if they differ in one
coordinate, and that difference is 1. It is known that this graph
has one infinite and many finite components.
Is there an infinite path consisting of visible lattice points, where
both coordinates tend to infinity and no point on the path has
both coordinates a prime number? (Erdos offers $25 for a proof or
disproof.)
| T.R | Title | User | Personal
Name | Date | Lines
|
|---|