2 Ambirika

The research problem
GCD and sets of consecutive integers
Chinese remainder theorem
A glimpse into our current work
Applying the Chinese remainder theorem to a

lattice point geometry problem
Aba Mbirika
Assistant Professor of Mathematics
October 17, 2014

SACNAS National Conference Los Angeles, CA
Scientific Symposia on
Abstract algebra research topics for undergraduates
Outline
A connection to visible lattice points

Imagine the plane R2 as a forest in which each non-origin lattice
point in Z2 is a tree. Imagining for a moment that each tree is
infinitely thin, we say that a tree is hidden from your view at the
origin if some other tree lies in your line of sight.
6
5
4
3
2
1
1

6
5
4
3
2
1
1

6
5
4
3
2
1
1

6
5
4
3
2
1
1

6
5
(3,4)
4
3
(1,3)
2
(2,1)
(5,1)
1
1

(2,6)
6
5
(3,4)
4
3
(1,3)
(6,3)
(4,2)
2
(2,1)
(5,1)
1
1
A invisibility criterion
Theorem
A point (x, y) is invisible from the origin if there is any point
(x0 , y0 ) such that (x, y) = (cx0 , cy0 ) for some c N>1 . That is, if
c divides both x and y, then (x, y) is not visible from the origin.
Hence the only visible points are the points (x, y) such that
gcd(x, y) = 1.
Theorem
gcd(x, y) = 1.
A natural question to ask is the following:
Theorem
gcd(x, y) = 1.
A natural question to ask is the following:

Question
What fraction of integer lattice points are visible from the origin?
Consider the square n = {(x, y) Z2 : |x| n, |y| n}

centered about the origin.

centered about the origin. Define V (n) and T (n) as:
V (n) = the number of visible lattice points in n , and
T (n) = the total number of integer lattice points in n .

V (n)
.
n T (n)
It suffices to compute lim

V (n)
. Any guesses?
n T (n)

V (n)
. Any guesses?
n T (n)

Conjecture (Cesaro, 1881)
The probability that two random integers are relatively prime is
6
.
2

V (n)
. Any guesses?
n T (n)

6
.
2
Lattice point geometers would say:

The fraction of pairs (x, y) in the integer lattice Z2 that are visible
6
from the origin is 2 .

V (n)
. Any guesses?
n T (n)

6
.
2
Lattice point geometers would say:

The fraction of pairs (x, y) in the integer lattice Z2 that are visible
6
from the origin is 2 .
Does anyone recognize the reciprocal of this value?
A pretty picture
A pretty picture
There are 35 visible points above.
A pretty picture
There are 35 visible points above. So the 15 15 square about the

origin will have (35 4) + 4 = 144 visible points.
A pretty picture

origin will have (35 4) + 4 = 144 visible points. The fraction of
144
visible points is
= 0.64.
225
A pretty picture

144
6
visible points is
= 0.64. That is within .032 of 2 .608.
225
A pretty picture

144
6
visible points is
= 0.64. That is within .032 of 2 .608.
225
QUESTION: Do you see any 2 2 squares of invisible points?
The CLOSEST 2 2 hidden forest
(7,5)
(4,3)
(3,2)
(10,7)
(20,15)
(21,15)
(20,14)
(21,14)
(1274, 1310)
(1274, 1309)
(1274, 1308)
(1275, 1310)
(1275, 1309)
(1275, 1308)
(1276, 1310)
(1276, 1309)
(1276, 1308)

NOBODY KNOWS. . . yet.

NOBODY KNOWS. . . yet.
And this makes dogs sad and babies cry.
Do arbitrarily large squares of hidden forests exist?
Do arbitrarily large squares of hidden forests exist?
To answer this let us move to the exciting world of abstract

algebra. But first a motivating math question for the audience.
Outline
The 3 3 case reconsidered

Recall that the following is the closest 3 3 hidden forest.
(1275, 1310)
(1274, 1310)
(1276, 1310)
(1274, 1309)
(1276, 1309)
(1275, 1309)
(1274, 1308)
(1276, 1308)
(1275, 1308)

(1275, 1310)
(1274, 1310)
(1276, 1310)
(1274, 1309)
(1276, 1309)
(1275, 1309)
(1274, 1308)
(1276, 1308)
(1275, 1308)
Consider the two sets of integers:

A1 = {1274, 1275, 1276} and A2 = {1308, 1309, 1310}.

(1275, 1310)
(1274, 1310)
(1276, 1310)
(1274, 1309)
(1276, 1309)
(1275, 1309)
(1274, 1308)
(1276, 1308)
(1275, 1308)

A1 = {1274, 1275, 1276} and A2 = {1308, 1309, 1310}.
Is it true that gcd(a1 , a2 ) > 1 whenever a1 A1 and a2 A2 ?

(1275, 1310)
(1274, 1310)
(1276, 1310)
(1274, 1309)
(1276, 1309)
(1275, 1309)
(1274, 1308)
(1276, 1308)
(1275, 1308)

A1 = {1274, 1275, 1276} and A2 = {1308, 1309, 1310}.
Is it true that gcd(a1 , a2 ) > 1 whenever a1 A1 and a2 A2 ?
Can we find two sets of 4 consecutive integers satisfying the
gcd property above?
Math for thought
Are there arbitrarily large disjoint sets satisfying the question

in the previous slide?
Math for thought
Are there arbitrarily large disjoint sets satisfying the question

in the previous slide?
More precisely, can we prove the following?

Theorem
For every n N, there exists disjoint sets A1 and A2 each
containing n consecutive natural numbers such that
gcd(a1 , a2 ) > 1 whenever a1 A1 and a2 A2 .
Outline
Sun Tsus question in the 4th century A.D.

Sun Tsu asked, Find a number which leaves the remainders
2, 3, and 2 when divided by 3, 5, and 7, respectively.

In the language of mathematics, Sun Tsus problem corresponds to
the following system of linear congruences:
x 2 (mod 3)
x 3 (mod 5)
x 2 (mod 7)

In the language of mathematics, Sun Tsus problem corresponds to
the following system of linear congruences:
x 2 (mod 3)
x 3 (mod 5)
x 2 (mod 7)
Via the CRT-algorithm, we get the unique solution x = 23.
The Chinese Remainder Theorem (CRT)

Theorem
Let n1 , n2 , . . . , nr be positive integers such that gcd(ni , nj ) = 1
for i 6= j. Then the system of linear congruences
x a1 (mod n1 )
x a2 (mod n2 )
..
.
x ar (mod nr )
has a simultaneous solution, which is unique modulo the integer
n1 n2 n r .
The Chinese Remainder Theorem (CRT)

Theorem
Let n1 , n2 , . . . , nr be positive integers such that gcd(ni , nj ) = 1
for i 6= j. Then the system of linear congruences
x a1 (mod n1 )
x a2 (mod n2 )
..
.
x ar (mod nr )
has a simultaneous solution, which is unique modulo the integer
n1 n2 n r .
Proof.
See any number theory or abstract algebra textbook.
To construct a 2 2 hidden forest,
To construct a 2 2 hidden forest, first consider the prime matrix

2 3
.
5 7

2 3
.
5 7
The row products are R1 = 6 and R2 = 35, while the column
products are C1 = 10 and C2 = 21.

2 3
.
5 7
products are C1 = 10 and C2 = 21. We need to solve the following
linear congruences:
x+10
x+20
(mod 6)
(mod 35)
y+10
y+20
(mod 10)
(mod 21).

2 3
.
5 7
linear congruences:
x+10
x+20
(mod 6)
(mod 35)
y+10
y+20
(mod 10)
(mod 21).
CRT-algorithm says the left and right systems have the unique
solutions x0 = 173 (mod 210) and y0 = 19 (mod 210).

2 3
.
5 7
linear congruences:
x+10
x+20
(mod 6)
(mod 35)
y+10
y+20
(mod 10)
(mod 21).
solutions x0 = 173 (mod 210) and y0 = 19 (mod 210). So let
A1 = {174, 175} and A2 = {20, 21}.

2 3
.
5 7
linear congruences:
x+10
x+20
(mod 6)
(mod 35)
y+10
y+20
(mod 10)
(mod 21).
A1 = {174, 175} and A2 = {20, 21}. Its easily verified that
A1 A2 = and gcd(a1 , a2 ) > 1 for each ai Ai .

2 3
.
5 7
linear congruences:
x+10
x+20
(mod 6)
(mod 35)
y+10
y+20
(mod 10)
(mod 21).
A1 A2 = and gcd(a1 , a2 ) > 1 for each ai Ai . We get the
following 2 2 hidden forest (left), and corresponding gcds (right):

2 3
.
5 7
linear congruences:
x+10
x+20
(mod 6)
(mod 35)
y+10
y+20
(mod 10)
(mod 21).
A1 A2 = and gcd(a1 , a2 ) > 1 for each ai Ai . We get the
following 2 2 hidden forest (left), and corresponding gcds (right):
(174,21)
(175,21)
gcd = 3
gcd = 7
(174,20)
(175,20)
gcd = 2
gcd = 5
How do we find an n n hidden forest for any n N?

Recall our favorite theorem from a few slides back.
Theorem

Recall our favorite theorem from a few slides back.
Theorem
By going back to the last slide, I will

sketch the proof.
Why this method stinks for finding hidden forests!

Question
If we use this method to calculate the location of sixteen trees in a
4 4 hidden forest, then the solution to the 16 linear congruence
equations are
x0 = 847, 617, 195, 518, 191, 809
y0 = 1, 160, 906, 121, 308, 397, 397

Question
equations are
x0 = 847, 617, 195, 518, 191, 809
y0 = 1, 160, 906, 121, 308, 397, 397
Doesnt this seem ridiculously far from the origin?

Question
equations are
x0 = 847, 617, 195, 518, 191, 809
y0 = 1, 160, 906, 121, 308, 397, 397
Is there a closer forest?

Question
equations are
x0 = 847, 617, 195, 518, 191, 809
y0 = 1, 160, 906, 121, 308, 397, 397
Is there a closer forest? We have found a closer forest, but
we do not yet have the computer exhaustive-checking ability
to determine if it is the closest one.

Question
equations are
x0 = 847, 617, 195, 518, 191, 809
y0 = 1, 160, 906, 121, 308, 397, 397
Is there a closer forest? We have found a closer forest, but
we do not yet have the computer exhaustive-checking ability
to determine if it is the closest one.
This topic for general n n settings would make a GREAT
undergraduate research project.
Outline
Counter-clockwise rotation of a prime matrix

In the 3 3 case, the CRT-algorithm gives the terribly far solution:
x0 = 119, 740, 619 and y0 = 121, 379, 047.

x0 = 119, 740, 619 and y0 = 121, 379, 047.
The gcd-grid of the forest is the following:
25
3
22
13
11
7
223
19
217

x0 = 119, 740, 619 and y0 = 121, 379, 047.
The gcd-grid of the forest is the following:
25
3
22
13
11
7
223
19
217
5 13 23
2 3 5

g P = 3 11 19 .
P = 7 11 13 7 Gcd
90 left
2 7 17
17 19 23
g P divides the (i, j)-entry of the
Observe that the (i, j)-entry of Gcd
gcd-grid.
A clockwise rotation of gcd-matrix

Below we recall the CLOSEST 3 3 hidden forest and its gcd-grid.
(1275, 1310)
(1274, 1310)
(1276, 1310)
(1274, 1309)
(1276, 1309)
(1275, 1309)
(1274, 1308)
(1276, 1308)
(1275, 1308)
5
17
3
2
11
22

(1275, 1310)
(1274, 1310)
(1276, 1310)
(1274, 1309)
(1276, 1309)
(1275, 1309)
(1274, 1308)
(1276, 1308)
(1275, 1308)
We can retrieve a
7
GcdM =
2
5
17
3
matrix M from the gcd-grid above
5 2
2

17 11
3
7 M =
90 right
3 22
22
2
11
22
as follows:
7 2
17 5 .
11 2

(1275, 1310)
(1274, 1310)
(1276, 1310)
(1274, 1309)
(1276, 1309)
(1275, 1309)
(1274, 1308)
(1276, 1308)
(1275, 1308)
We can retrieve a
7
GcdM =
2
5
17
3
5 2
2

17 11
3
7 M =
90 right
3 22
22
2
11
22
as follows:
7 2
17 5 .
11 2
But we cannot perform the CRT-algorithm on the rows and

columns of this matrix M .

(1275, 1310)
(1274, 1310)
(1276, 1310)
(1274, 1309)
(1276, 1309)
(1275, 1309)
(1274, 1308)
(1276, 1308)
(1275, 1308)
We can retrieve a
7
GcdM =
2
5
17
3
5 2
2

17 11
3
7 M =
90 right
3 22
22
2
11
22
as follows:
7 2
17 5 .
11 2
But we cannot perform the CRT-algorithm on the rows and

columns of this matrix M .
WHY NOT?
Quasiprime matrices to the rescue!!!

From the matrix M , we can produce the quasiprime matrix as
follows using the QP-algorithm:
2 7 2
1 7 1
QP
M = 3 17 5 7 QPM = 3 17 5 .
algorithm
22 11 2
22 11 1

2 7 2
1 7 1
QP
M = 3 17 5 7 QPM = 3 17 5 .
algorithm
22 11 2
22 11 1
By use of the CRT-algorithm on QPM , we solve the following
system of linear congruences
x + 1 0 (mod 7)
x + 2 0 (mod 3 5 17)
x + 3 0 (mod 22 11)
y + 1 0 (mod 22 3)
y + 2 0 (mod 7 11 17)
y + 3 0 (mod 5)

2 7 2
1 7 1
QP
M = 3 17 5 7 QPM = 3 17 5 .
algorithm
22 11 2
22 11 1
x + 1 0 (mod 7)
x + 2 0 (mod 3 5 17)
x + 3 0 (mod 22 11)
y + 1 0 (mod 22 3)
y + 2 0 (mod 7 11 17)
y + 3 0 (mod 5)
and get solutions x0 = 1273 and y0 = 1307.

2 7 2
1 7 1
QP
M = 3 17 5 7 QPM = 3 17 5 .
algorithm
22 11 2
22 11 1
x + 1 0 (mod 7)
x + 2 0 (mod 3 5 17)
x + 3 0 (mod 22 11)
y + 1 0 (mod 22 3)
y + 2 0 (mod 7 11 17)
y + 3 0 (mod 5)
and get solutions x0 = 1273 and y0 = 1307.

Hence QPM yields the closest 3 3 hidden forest!!! YAY!
We have found the closest known 4 4 thus far!

Question (Project Euler Problem 47)
What is the smallest positive integer n such that the numbers in
the set {n, n + 1, n + 2, n + 3} have exactly four prime factors
each?

each?
The answer to this question is n = 134, 043.

each?
Set A1 = {134043, 134044, 134045, 134046}.

each?
Set A1 = {134043, 134044, 134045, 134046}. We then wrote a
Java code to exhaustively find the SMALLEST consecutive four
integers which ALL share factors with the four numbers in A1 .

each?
Is this fair?

each?
Is this fair?
Computer = Collaborator?!
Computer victorious in two minutes flat!

After running for only two minutes, the Java program outputs the
value 184,785,885.
Computer victorious in two minutes flat!

After running for only two minutes, the Java program outputs the
value 184,785,885.
So the closest known hidden forest has bottom left corner point
(134043, 183785885)
and has the following gcd-grid:
37
13
491
3
22 83
23 19
2 17
31 5
23
11
2
32
We retrieve a matrix M from the gcd-grid above as follows:
GcdM
37
13
=
491
3
22
23
2
31
83
19
17
5
23
11
M =

2 90 right
2
3
3
31
5
32
491
2
17
2
13
23
19
11
37
2
2
.
83
23
GcdM
37
13
=
491
3
22
23
2
31
83
19
17
5
23
11
M =

2 90 right
2
3
3
31
5
32
491
2
17
2
13
23
19
11
37
2
2
.
83
23
Applying the QP-algorithm to M , we get the following quasiprime

matrix
1
31
QPM =
5
32
491
1
17
1
13
23
19
11
7
22
.
83
1
GcdM
37
13
=
491
3
22
23
2
31
83
19
17
5
23
11
M =

2 90 right
2
3
3
31
5
32
491
2
17
2
13
23
19
11
37
2
2
.
83
23

matrix
1
31
QPM =
5
32
491
1
17
1
13
23
19
11
7
22
.
83
1
And applying the CRT-algorithm to QPM does indeed yield the

hidden 4 4 forest with bottom-left corner (134043, 184785885)
as desired.
GcdM
37
13
=
491
3
22
23
2
31
83
19
17
5
23
11
M =

2 90 right
2
3
3
31
5
32
491
2
17
2
13
23
19
11
37
2
2
.
83
23

matrix
1
31
QPM =
5
32
491
1
17
1
13
23
19
11
7
22
.
83
1
And applying the CRT-algorithm to QPM does indeed yield the

hidden 4 4 forest with bottom-left corner (134043, 184785885)
as desired.
Can we do this in the 5 5 case?
In 36 minutes, Mathematica found the smallest five integers with

at least 5 factors each. Their prime factorizations are
x1 = 129, 963, 314 = 2 13 37 53 2549
x2 = 129, 963, 315 = 3 5 31 269 1039
x3 = 129, 963, 316 = 22 7 97 109 439
x4 = 129, 963, 317 = 112 17 23 41 67
x5 = 129, 963, 318 = 2 3 89 199 1223.

x1 = 129, 963, 314 = 2 13 37 53 2549
x2 = 129, 963, 315 = 3 5 31 269 1039
x3 = 129, 963, 316 = 22 7 97 109 439
x4 = 129, 963, 317 = 112 17 23 41 67
x5 = 129, 963, 318 = 2 3 89 199 1223.
The Java code however ran for weeks without finding a set of 5
consecutive integers all which share a prime factor with all the
numbers above.

x1 = 129, 963, 314 = 2 13 37 53 2549
x2 = 129, 963, 315 = 3 5 31 269 1039
x3 = 129, 963, 316 = 22 7 97 109 439
x4 = 129, 963, 317 = 112 17 23 41 67
x5 = 129, 963, 318 = 2 3 89 199 1223.
numbers above.
Computer = Fail!

x1 = 129, 963, 314 = 2 13 37 53 2549
x2 = 129, 963, 315 = 3 5 31 269 1039
x3 = 129, 963, 316 = 22 7 97 109 439
x4 = 129, 963, 317 = 112 17 23 41 67
x5 = 129, 963, 318 = 2 3 89 199 1223.
numbers above.
Computer = Fail!
Time for a theoretical approach!
Since x1 , x3 , x5 2Z and x2 , x5 3Z, we know . . .
GcdM
y5
y4
y3
y2
=
y1
b3
b2
b1
x2
a2
a1
x1
x1
x2

7
M=
90
right
x3
x4
x5
c2
c1
x3
y1
b1
d1
e1
x5
d5
d4
d3
d2
d1
x4
y2
a1
c1
d2
y3
b2
d3
y4
a2
b3
c2
d4
e1
y5
d5
So we want a QPM of the following form
QPM =
1
b1
1
d1
1
a1
1
c1
d2
1
1
b2
1
d3
1
a2
b3
c2
d4
e1
1
1
1
d5
6
where
x1 = 2 13 37 53 2549
x2 = 3 5 31 269 1039
x3 = 22 7 97 109 439
x4 = 112 17 23 41 67
x5 = 2 3 89 199 1223
=
=
=
=
=
a1 , a2
b1 , b 2 , b 3
c1 , c2
d1 , d2 , d3 , d4 , d5
e1
{13, 37, 53, 2549},

{5, 31, 269, 1039},
{7, 97, 109, 439},
{11, 17, 23, 41, 67}, and
{89, 199, 1223}.
So we want a QPM of the following form
QPM =
1
b1
1
d1
1
a1
1
c1
d2
1
1
b2
1
d3
1
a2
b3
c2
d4
e1
1
1
1
d5
6
where
x1 = 2 13 37 53 2549
x2 = 3 5 31 269 1039
x3 = 22 7 97 109 439
x4 = 112 17 23 41 67
x5 = 2 3 89 199 1223
=
=
=
=
=
a1 , a2
b1 , b 2 , b 3
c1 , c2
d1 , d2 , d3 , d4 , d5
e1
{13, 37, 53, 2549},

{5, 31, 269, 1039},
{7, 97, 109, 439},
{11, 17, 23, 41, 67}, and
{89, 199, 1223}.
We wrote a program in Mathematica which applies the

CRT-algorithm to each of the possible 1,244,160 matrices.
And the winner is?
QPM =
1
31
1
67
1
37
1
109
17
1
1
5
1
41
1
13
269
7
23
89
1
1
1
11
6
y1 = 2, 546, 641, 254, 872, 348 = 22 31 67 461 664921471

y2 = 2, 546, 641, 254, 872, 349 = 32 17 37 109 8681 475421
y3 = 2, 546, 641, 254, 872, 350 = 2 52 41 11113 111784759
y4 = 2, 546, 641, 254, 872, 351 = 72 13 23 73 89 269 271 367
y5 = 2, 546, 641, 254, 872, 352 = 25 3 11 2411592097417
The forest found by the standard method is 1.07417 1020

times farther than the forest we found!
A conjecture and a Thank You!

Conjecture
For every hidden forest, there exists a quasiprime matrix QPM such
that the CRT-algorithm applied to QPM yields this hidden forest.
A conjecture and a Thank You!

Conjecture
For every hidden forest, there exists a quasiprime matrix QPM such
that the CRT-algorithm applied to QPM yields this hidden forest.
Thank you!
Please talk to me or email me if you would like a work-in-progress
draft of our work on this project.
mbirika@uwec.edu
http://people.uwec.edu/mbirika
Is there time to prove that thing I promised?


Recall our favorite theorem from many slides back.
Theorem

Recall our favorite theorem from many slides back.
Theorem
Lets now prove it!
To find an n n hidden forest, consider the
p1
p2
pj
pn+1
p
p
n+2
n+j
p2n+1
p
p
2n+2
2n+j
..
..
..
.
.
.
p(i1)n+1 p(i1)n+2 p(i1)n+j
..
..
..
.
.
.
p(n1)n+1 p(n1)n+2 p(n1)n+j
prime matrix
pn
p2n
p3n
..
.
p(i1)n+n
..
.
pn2
p1
p2
pj
pn+1
p
p
n+2
n+j
p2n+1
p
p
2n+2
2n+j
..
..
..
.
.
.
p(i1)n+1 p(i1)n+2 p(i1)n+j
..
..
..
.
.
.
p(n1)n+1 p(n1)n+2 p(n1)n+j
prime matrix
pn
p2n
p3n
..
.
p(i1)n+n
..
.
pn2
Let Ri and Cj be the product of the entries in row i and column j,

respectively, so we have
Ri =
n
Y
k=1
p(i1)n+k
and
Cj =
n1
Y
k=0
pkn+j .
p1
p2
pj
pn+1
p
p
n+2
n+j
p2n+1
p
p
2n+2
2n+j
..
..
..
.
.
.
p(i1)n+1 p(i1)n+2 p(i1)n+j
..
..
..
.
.
.
p(n1)n+1 p(n1)n+2 p(n1)n+j
prime matrix
pn
p2n
p3n
..
.
p(i1)n+n
..
.
pn2
Let Ri and Cj be the product of the entries in row i and column j,

respectively, so we have
Ri =
n
Y
k=1
p(i1)n+k
and
Cj =
n1
Y
pkn+j .
k=0
Since they share no primes in common, the row products

R1 , R2 , . . . , Rn are pairwise relatively prime. Similarly, the column
products C1 , C2 , . . . , Cn are pairwise relatively prime.
Consider the following pair of systems of linear congruences:

x + 1 0 (mod R1 )
x + 2 0 (mod R2 )
..
.
y+10
y+20
x+n0
y+n0
(mod Rn )
(mod C1 )
(mod C2 )
..
.
(mod Cn ).

x + 1 0 (mod R1 )
x + 2 0 (mod R2 )
..
.
y+10
y+20
x+n0
y+n0
(mod Rn )
(mod C1 )
(mod C2 )
..
.
Observe that R1 R2 Rn = C1 C2 Cn =
we denote M .
(mod Cn ).
Qn2
i=1 pi ,
which

x + 1 0 (mod R1 )
x + 2 0 (mod R2 )
..
.
y+10
y+20
x+n0
y+n0
(mod Rn )
(mod C1 )
(mod C2 )
..
.
Observe that R1 R2 Rn = C1 C2 Cn =
we denote M .
(mod Cn ).
Qn2
i=1 pi ,
which
By CRT, there exists solutions x0 and y0 to the left and right

systems, respectively, such that x0 and y0 are unique modulo
M.

x + 1 0 (mod R1 )
x + 2 0 (mod R2 )
..
.
y+10
y+20
x+n0
y+n0
(mod Rn )
..
.
Construct the following two sets:

1
2
(mod C1 )
(mod C2 )
A1 = {x0 + 1, x0 + 2, . . . , x0 + n}
A2 = {y0 + 1, y0 + 2, . . . , y0 + n}
(mod Cn ).

x + 1 0 (mod R1 )
x + 2 0 (mod R2 )
..
.
y+10
y+20
x+n0
y+n0
(mod Rn )
(mod C1 )
(mod C2 )
..
.
(mod Cn ).

1
2
A1 = {x0 + 1, x0 + 2, . . . , x0 + n}
A2 = {y0 + 1, y0 + 2, . . . , y0 + n}
For an arbitrary x0 + i A1 and y0 + j A2 , these two

elements by construction are multiples of Ri and Cj ,
respectively, and hence the prime that lies in the intersection
of row i and column j in the matrix, namely p(i1)n+j , divides
gcd(x0 + i, y0 + j). Thus gcd(x0 + i, y0 + j) > 1 as desired.

x + 1 0 (mod R1 )
x + 2 0 (mod R2 )
..
.
y+10
y+20
x+n0
y+n0
(mod Rn )
(mod C1 )
(mod C2 )
..
.
(mod Cn ).

1
2
A1 = {x0 + 1, x0 + 2, . . . , x0 + n}
A2 = {y0 + 1, y0 + 2, . . . , y0 + n}
For an arbitrary x0 + i A1 and y0 + j A2 , these two

elements by construction are multiples of Ri and Cj ,
respectively, and hence the prime that lies in the intersection
of row i and column j in the matrix, namely p(i1)n+j , divides
gcd(x0 + i, y0 + j). Thus gcd(x0 + i, y0 + j) > 1 as desired.
Q.E.D.!
Extension to higher dimensions?

Consider the lattice Zd .

Can we find arbitrarily large d-cubes in this d-dimensional space?

Can we find arbitrarily large d-cubes in this d-dimensional space?
YES! And in fact a d-dimensional version of the latter theorem
exists as follows:
Theorem
For every n, d N, there exists disjoint sets A1 , A2 , . . . , Ad each
gcd(a1 , a2 , . . . , ad ) > 1 whenever ai Ai for each i = 1, 2, . . . , d.

2 Ambirika

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2 Ambirika

Uploaded by

Copyright:

Available Formats

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

Applying the Chinese remainder theorem to a

October 17, 2014

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A glimpse into our current work

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A connection to visible lattice points

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A connection to visible lattice points

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A connection to visible lattice points

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A connection to visible lattice points

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A connection to visible lattice points

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A connection to visible lattice points

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A natural question to ask is the following:

The research problem

GCD and sets of consecutive integers

Chinese remainder theorem

A glimpse into our current work

A natural question to ask is the following:

The research problem