Electronic Proceedings of the Twenty-fifth Annual International Conference on Technology in Collegiate Mathematics

Boston, Massachusetts, March 21-24, 2013

Paper C008

This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Twenty-fifth Annual International Conference on Technology in Collegiate Mathematics, ISBN-10: 0133866726, Copyright (C) 2014 by Pearson Education, Inc.


Using Computers to Explore Non-Repetitive Sequences

Richard Coultas


Indiana University of Pennsylvania

Click to access this paper: paper.pdf

ABSTRACT

Sequences are often analyzed by finding patterns. However, the absence of patterns also leads to interesting investigations. In particular, non-repetitive sequences are those that do not contain adjacent identical blocks. Non-repetitive sequences are only the beginning. Strongly non-repetitive sequences and additively non-repetitive sequences add stricter levels of non-repetition. Research into additively non-repetitive sequences requires computers to do many of the required calculations. A description of an algorithm used to construct and test for additively non-repetitiveness will be provided, then results from research will be analyzed.

Keyword(s): discrete mathematics