The Monochromatic Column Problem: The Prime Case

<p>Let p1, p2, . . . , pn be pairwise coprime positive integers and let P = p1p2 · · · pn. Let 0,1,...,m−1 be a sequence of m different colors. Let A be an n×mP matrix of colors in which row i consists of blocks of pi consecutive entries of the same color, with colors 0 through m − 1 repeated cyclically. The Monochromatic Column problem is to determine the number of columns of A in which every entry is the same color. A partial solution for the case when m is prime is given. </p>

Name thesis:degree_name

Master of Arts (MA)

Level thesis:degree_level

Master's

Discipline thesis:degree_discipline

Mathematics and Statistics

Grantor dc:publisher

Eastern Kentucky University

Year

2016

Author dc:creator

• Crowell, Loran Elizabeth

• Chinese Remainder Theorem
• Monochromatic Column
• Number Theory

Statement dc:rights

• Copyright 2016 Loran Elizabeth Crowell

Repository record dc:identifier

https://encompass.eku.edu/etd/356

OAI identifier oai:identifier

oai:encompass.eku.edu:etd-1354