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

Denver, Colorado, March 17-20, 2011

Paper S094

This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Twenty-third Annual International Conference on Technology in Collegiate Mathematics, ISBN 0-321-68984-4, Copyright (C) 2012 by Pearson Education, Inc.


Using Maple to Enumerate Restricted Binary Rectangles

Joel C. Fowler


Southern Polytechnic State University

list of all papers by this author

Click to access this paper: paper.pdf

ABSTRACT

We generalize the counting of binary strings without certain sub-strings to the enumeration of binary rectangles without particular sub-rectangles. We examine how Maple can be used at a student project level to study the problem, generate examples and motivate theoretical results.

Keyword(s): Maple, linear algebra